Every conditional has three relatives, made by swapping and negating its parts. Only one of them says the same thing as the original. This builds on Logical Equivalence.
| Name | Form | Equivalent to $p \to q$? |
|---|---|---|
| Original | $p \to q$ | yes |
| Converse | $q \to p$ | no |
| Inverse | $\neg p \to \neg q$ | no |
| Contrapositive | $\neg q \to \neg p$ | yes |
Key idea
Why it works
Worked examples
Worked example: All three relatives
- Converse (swap): $\neg s \to r$.
- Inverse (negate both): $\neg r \to \neg \neg s$, which may be written $\neg r \to s$.
- Contrapositive (swap and negate): $\neg \neg s \to \neg r$, that is $s \to \neg r$.
Answer: The contrapositive $s \to \neg r$ is the only one equivalent to the original.
Worked example: In English
- Swap the parts and negate both.
Answer: "If you do not get into the show, you do not have a ticket."
Common mistake
Worked example: A converse that fails
- The converse is "If a shape has four sides, it is a square."
- A rectangle that is not a square has four sides.
Answer: No. The original is true and its converse is false, so they cannot be equivalent.
There is a neat pattern in the table: the inverse is the contrapositive of the converse. Swap $q \to p$ and negate both parts and you get $\neg p \to \neg q$. That is why the converse and the inverse always agree with each other, while the original and the contrapositive agree with each other.
The contrapositive is useful in proofs. When $p \to q$ is hard to show directly, showing $\neg q \to \neg p$ proves the same thing. Later this becomes a rule of replacement, Transposition (Transposition and Material Implication (Trans, Impl)).