NAND as Disjunction of Negations/Proof 1
Jump to navigation
Jump to search
Theorem
- $p \uparrow q \dashv \vdash \neg p \lor \neg q$
Proof
| \(\ds p \uparrow q\) | \(\dashv \vdash\) | \(\ds \map \neg {p \land q}\) | Definition of Logical NAND | |||||||||||
| \(\ds \) | \(\dashv \vdash\) | \(\ds \neg p \lor \neg q\) | De Morgan's Laws: Disjunction of Negations |
$\blacksquare$