What is De Morgan's law?

De Morgan's law states that:

  • The negation (NOTNOT) of conjunction (ANDAND) is equivalent to the disjunction (OROR) of the negation of the individual propositions.

or

  • The negation (NOTNOT) of disjunction (OROR) is equivalent to the conjunction (ANDAND) of the negation of the individual propositions.

Mathematically, if pp and qq are two propositions, then De Morgan's law states:

or

Named after a British mathematician Augustus De Morgan, this law can be extended to any number of propositions connected by logical operators. Such as the following expression shows De Morgan's law applied over four propositions:

Proof by the truth table

We can prove De Morgan's law by comparing the truth values for its left and right-hand sides. Let's try to make a truth table for p+q=p.q\overline{p+q} = \overline{p}.\overline{q}

Truth table for De Morgan's law

p

q

¬p

¬q

p+q

¬(p+q)

¬p.¬q

T

T

F

F

T

F

F

T

F

F

T

T

F

F

F

T

T

F

T

F

F

F

F

T

T

F

T

T

The second last column of the above table represents the truth values of De Morgan's law's left-hand side (L.H.S), while the last column shows the corresponding truth values for the right-hand side (R.H.S).

We can see that both L.H.S and R.H.S are equivalent to each other, which proves the validity of De Morgan's law.

De Morgan's law in sets

De Morgan's law is also applicable in the set theory as follows:

  • The complement of the union (\cup) of sets is equivalent to the intersection (\cap) of the complement of the individual sets.

or

  • The complement of the intersection (\cap) of sets is equivalent to the union (\cup) of the complement of the individual sets.

Mathematically, if AA and BB are two sets, then De Morgan's law states:

or

Proof of De Morgan's law for sets

Consider AA and BB are two sets. Suppose De Morgan's law for these sets is as follows:

Let's take it's L.H.S:

Suppose xx is an element that belongs to the resultant set of (AB)(A \cup B)'. Hence, we can say that:

If xx is in (AB)(A \cup B)', then it's obvious that xx won't be in it's complement:

If xx is not in the union of AA and BB, then xx is neither in AA nor in BB:

If xx is not in AA and BB , then it's obvious that xx will be in their complements:

If xx is in bothAA' and BB', then it will also be in their intersection:

From this, we can say that:

Now, on the R.H.S, suppose that yy is an element that belongs to the resultant set of ABA' \cap B':

If yy is in the intersection of AA' and BB' , then it's obvious that yy will be in both AA' and BB' :

If yy is in AA' and BB' , then it won't be in their complements:

If yy is neither in AA nor in BB , then it's obvious that yy won't be in their union:

If yy is not in (AB)(A \cup B) , then it will definately be in (AB)(A \cup B)':

From this, we can say that:

From (1) and (2)(1) \textnormal{ and } (2) we can deduce that:

Note: Learn about logic gates to build De Morgan's law's circuitry.

Free Resources

Copyright ©2025 Educative, Inc. All rights reserved