De Morgan's Laws (Boolean Algebras)

Theorem
Let $\struct {S, \vee, \wedge, \neg}$ be a Boolean algebra.

Then for all $a, b \in S$:
 * $\neg \paren {a \vee b} = \neg a \wedge \neg b$
 * $\neg \paren {a \wedge b} = \neg a \vee \neg b$

Proof
By virtue of Complement in Boolean Algebra is Unique, it will suffice to verify:


 * $\paren {a \vee b} \wedge \paren {\neg a \wedge \neg b} = \bot$
 * $\paren {a \vee b} \vee \paren {\neg a \wedge \neg b} = \top$

For the first of these, compute:

By the Duality Principle, we also conclude:


 * $\paren {a \wedge b} \vee \paren {\neg a \vee \neg b} = \top$

Substituting $\neg a$ and $\neg b$ for $a$ and $b$, respectively, this becomes:


 * $\paren {\neg a \wedge \neg b} \vee \paren {a \vee b} = \top$

where Complement of Complement (Boolean Algebras) was applied.

Since $\vee$ is commutative, we have also derived the second of the two equations above.

Hence:


 * $\neg \paren {a \vee b} = \neg a \wedge \neg b$

Now by again the Duality Principle:


 * $\neg \paren {a \wedge b} = \neg a \vee \neg b$

follows immediately.

Also see

 * De Morgan's Laws (Logic)
 * De Morgan's Laws (Predicate Logic)
 * De Morgan's Laws (Set Theory)