Skip to main content

State and prove De Morgan's laws

Short answer

De Morgan's laws: ¬(A+B) = ¬A·¬B and ¬(A·B) = ¬A+¬B. Proof by truth table shows both sides match for all four input combinations, confirming the identities.

State and prove De-Morgan's laws.

First theorem: the complement of a sum (OR) of variables equals the product (AND) of their complements.

A+B‾=Aˉ⋅Bˉ\overline{A + B} = \bar{A} \cdot \bar{B}

Second theorem: the complement of a product (AND) of variables equals the sum (OR) of their complements.

A⋅B‾=Aˉ+Bˉ\overline{A \cdot B} = \bar{A} + \bar{B}

In words: "break the bar and change the sign".

Proof by truth table

ABA+B‾\overline{A+B}Aˉ⋅Bˉ\bar A \cdot \bar BAB‾\overline{AB}Aˉ+Bˉ\bar A + \bar B
001111
010011
100011
110000

For all four input combinations, column 3 equals column 4 and column 5 equals column 6, so both theorems are proved.

Algebraic proof (Theorem 1): let X=A+BX = A + B and Y=AˉBˉY = \bar A \bar B. Then X+Y=A+B+AˉBˉ=A+B+Bˉ=1X + Y = A + B + \bar A \bar B = A + B + \bar B = 1 and XY=AAˉBˉ+BAˉBˉ=0X Y = A\bar A \bar B + B \bar A \bar B = 0. A variable that ORs with X to give 1 and ANDs with X to give 0 is Xˉ\bar X, so A+B‾=AˉBˉ\overline{A+B} = \bar A \bar B. Theorem 2 follows by duality.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Digital Logic chapter 2 questions →