De Morgan's law states that:
The negation (
or
The negation (
Mathematically, if
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:
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 | 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 is also applicable in the set theory as follows:
The complement of the union (
or
The complement of the intersection (
Mathematically, if
or
Consider
Let's take it's L.H.S:
Suppose
If
If
If
If
From this, we can say that:
Now, on the R.H.S, suppose that
If
If
If
If
From this, we can say that:
From
Note: Learn about logic gates to build De Morgan's law's circuitry.
Free Resources