Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Proof of De-Morgan’s laws in boolean algebra

  • Difficulty Level : Easy
  • 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.

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

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.

My Personal Notes arrow_drop_up
Recommended Articles
Page :