Conjunction with Negative is Equivalent to Negation of Conditional

From ProofWiki
Jump to navigation Jump to search

Theorem

Formulation 1

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

Formulation 2

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