Related Articles

Related Articles

Proof of De-Morgan’s laws in boolean algebra
  • Difficulty Level : Medium
  • Last Updated : 14 May, 2020

Statements :
1. (x+y)'= x'. y'
2. (x.y)'=x'+y'

Here we can see that we need to prove that the two propositions are complement to each other.
We know that A+A'=1 and A.A'=0 which are annihilation laws. Thus if we prove these conditions for the above statements of the laws then we shall prove that they are complement of each other.

For statement 1:
We need to prove that:
(x+y)+x'.y'=1 and (x'.y').(x+y)=0

Case 1.
LHS: (x+y)+x'.y' =(x+y).(x+x')+x'.y'
=x.x+x.y+y.x'+x'.y'=x+x.y+y.x'+x'.y'{Using distributive property}
Hence proved.

Case 2.
LHS: (x'.y').(x+y)=x.(x'y')+y.(x'.y')
Hence proved.

For statement 2:
We need to prove that:
x.y+(x'+y')=1 and x.y.(x'+y')=0

Case 1.
 LHS: x.y+(x'+y')=(x+x'+y').(y+x'+y')
{We know that A+BC=(A+B).(A+C)}
Hence proved.

Case 2.
LHS: (x.y).(x'+y')=x.x'.y+x.y.y'
Hence Proved.
This proves the De-Morgan’s theorems using identities of Boolean Algebra.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :