Proof by Contradiction/Variant 2

Theorem

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

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