NAND as Disjunction of Negations/Proof 1

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$

This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.