Conjunction is Equivalent to Negation of Conditional of Negative

From ProofWiki
Jump to navigation Jump to search

Theorems

Formulation 1

$p \land q \dashv \vdash \neg \paren {p \implies \neg q}$

Formulation 2

$\vdash \paren {p \land q} \iff \paren {\neg \paren {p \implies \neg q} }$