Rule of Transposition/Formulation 1/Proof 1

Theorem

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

Law of Excluded Middle
Note that the proof of the reverse implication requires the use of double negation elimination, which depends on the Law of the Excluded Middle. This axiom is not accepted by the intuitionist school.