Proof by Contradiction/Variant 2
Jump to navigation
Jump to search
Theorem
Formulation 1
- $p \implies q, p \implies \neg q \vdash \neg p$
Formulation 2
- $\vdash \paren {\paren {p \implies q} \land \paren {p \implies \neg q} } \implies \neg p$