# Rule of Transposition/Variant 2/Formulation 2/Reverse Implication

Jump to navigation
Jump to search

## Theorem

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

## Proof

By the tableau method of natural deduction:

Line | Pool | Formula | Rule | Depends upon | Notes | |
---|---|---|---|---|---|---|

1 | 1 | $\neg q \implies p$ | Assumption | (None) | ||

2 | 2 | $\neg p$ | Assumption | (None) | ||

3 | 1, 2 | $\neg \neg q$ | Modus Tollendo Tollens (MTT) | 1, 2 | ||

4 | 1, 2 | $q$ | Double Negation Elimination: $\neg \neg \mathcal E$ | 3 | ||

5 | 1 | $\neg p \implies q$ | Rule of Implication: $\implies \mathcal I$ | 2 – 4 | Assumption 2 has been discharged | |

6 | $\left({\neg q \implies p}\right) \implies \left({\neg p \implies q}\right)$ | Rule of Implication: $\implies \mathcal I$ | 1 – 5 | Assumption 1 has been discharged |

$\blacksquare$

#### Law of the Excluded Middle

This proof depends on the Law of the Excluded Middle, by way of Double Negation Elimination.

This is one of the axioms of logic that was determined by Aristotle, and forms part of the backbone of classical (Aristotelian) logic.

However, the intuitionist school rejects the Law of the Excluded Middle as a valid logical axiom. This in turn invalidates this proof from an intuitionistic perspective.