Proof by Contradiction/Variant 2/Formulation 2

Theorem

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