Proof by Contradiction/Variant 2

From ProofWiki
Jump to: navigation, search

Theorem

Formulation 1

$p \implies q, p \implies \neg q \vdash \neg p$

Formulation 2

$\vdash \left({\left({p \implies q}\right) \land \left({p \implies \neg q}\right)}\right) \implies \neg p$