You know the contrapositive of "if P then Q" is "if \lnot Q then \lnot P." But what about "P if and only if Q"? A biconditional does not seem to have a head and a tail the way a one-way implication does, so the word "contrapositive" feels ambiguous. What gets flipped? What gets negated?
The answer turns out to be clean: the contrapositive of "P iff Q" is "\lnot P iff \lnot Q", and the two biconditionals are logically equivalent. This article unpacks why, what it looks like in practice, and how this fact is used when proving biconditional statements by contrapositive.
What a biconditional actually is
The biconditional "P if and only if Q" — written P \Leftrightarrow Q — is a combined statement that packages two one-way implications:
- P \Rightarrow Q (the "only if" direction: "P only if Q" means "P cannot hold without Q").
- Q \Rightarrow P (the "if" direction: "P if Q" means "Q is enough to guarantee P").
P \Leftrightarrow Q is true exactly when both implications are true. In truth-table form, P \Leftrightarrow Q is true whenever P and Q have the same truth value — both true or both false — and false otherwise.
Taking the contrapositive of each direction
Since a biconditional is two implications, you can take the contrapositive of each one:
- Contrapositive of P \Rightarrow Q is \lnot Q \Rightarrow \lnot P.
- Contrapositive of Q \Rightarrow P is \lnot P \Rightarrow \lnot Q.
Now combine these two implications — the contrapositives — into a new biconditional:
That is, \lnot P if and only if \lnot Q. This is the contrapositive of the biconditional.
Contrapositive of a biconditional
The contrapositive of "P if and only if Q" is "\lnot P if and only if \lnot Q." The two biconditionals are logically equivalent.
Why the two biconditionals are equivalent
Each direction of the original biconditional is equivalent to its contrapositive:
- P \Rightarrow Q is equivalent to \lnot Q \Rightarrow \lnot P.
- Q \Rightarrow P is equivalent to \lnot P \Rightarrow \lnot Q.
Since a biconditional is just "both directions at once," replacing each direction with its contrapositive gives you an equivalent biconditional. You are swapping each half for something logically identical, so the whole thing remains logically identical.
Here is the truth table side by side.
| P | Q | \lnot P | \lnot Q | P \Leftrightarrow Q | \lnot P \Leftrightarrow \lnot Q |
|---|---|---|---|---|---|
| T | T | F | F | T | T |
| T | F | F | T | F | F |
| F | T | T | F | F | F |
| F | F | T | T | T | T |
Columns 5 and 6 match in every row. The two biconditionals are true and false in exactly the same situations — logically equivalent.
A worked example
Consider: "n is even if and only if n^2 is even."
- Original. n is even \Leftrightarrow n^2 is even.
- Contrapositive. n is odd \Leftrightarrow n^2 is odd.
Both biconditionals are true. The first says: "evenness transfers both ways between n and n^2." The second says: "oddness transfers both ways between n and n^2." These are the same claim, because for integers "not even" means "odd" and vice versa.
Why the two versions carry identical content: the original covers the "even ↔ even" case; the contrapositive covers the "odd ↔ odd" case. Since every integer is either even or odd, covering both cases in either form captures the full content of the biconditional.
A visual: two arrows, both flipped together
A single implication is one arrow. A biconditional is two arrows, one in each direction. Taking the contrapositive of a biconditional flips each arrow and negates both endpoints:
Using this in proofs
When you need to prove "P if and only if Q," you prove both directions. For each direction, you can choose between direct proof and contrapositive. A common pattern: prove one direction directly and the other by contrapositive.
Proving "$n$ is even iff $n^2$ is even" with a mixed strategy
Claim. For any integer n: n is even \Leftrightarrow n^2 is even.
Forward direction (direct). Suppose n is even, so n = 2k. Then n^2 = 4k^2 = 2(2k^2), which is even. Done.
Why direct works here: the hypothesis "n is even" gives n = 2k, which squares cleanly. Squaring is the easy direction of arithmetic.
Backward direction (contrapositive). To prove "if n^2 is even, then n is even," prove the contrapositive: "if n is odd, then n^2 is odd." Suppose n is odd, so n = 2k + 1. Then n^2 = 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1, which is odd. Done.
Why contrapositive works here: the hypothesis "n^2 is even" does not factor cleanly. Flipping to "n is odd" gives a usable expression and the computation is a one-liner.
Conclusion. Both directions established. n is even iff n^2 is even. \square
Notice what happened: in the backward direction, taking the contrapositive of n^2 \text{ even} \Rightarrow n \text{ even} gave you n \text{ odd} \Rightarrow n^2 \text{ odd}. You then proved that one-way implication directly. You did not need to invoke the biconditional version of contrapositive — you just used the standard contrapositive on each direction separately.
Alternative: the "double contrapositive" directly
You could also prove the biconditional P \Leftrightarrow Q by proving the single biconditional \lnot P \Leftrightarrow \lnot Q in one go. Since the two are logically equivalent, establishing one establishes the other. This is rare in practice — it is usually cleaner to split into two one-way implications and handle each separately — but the option is there when the "negative" phrasing is more natural.
A quick checklist
When asked for the contrapositive of a biconditional:
- Identify the two statements P and Q on either side of the "iff."
- Negate both to get \lnot P and \lnot Q.
- Connect the negations with "if and only if."
- The resulting biconditional is logically equivalent to the original.
Do not flip the order of P and Q (flipping is for the converse of a one-way implication). A biconditional is symmetric — P \Leftrightarrow Q is the same as Q \Leftrightarrow P — so flipping changes nothing. The only real operation is negating both sides.
The one-sentence takeaway
A biconditional P \Leftrightarrow Q is two implications at once. Its contrapositive is the biconditional obtained by negating both sides, \lnot P \Leftrightarrow \lnot Q, which is logically equivalent to the original. When proving a biconditional, you can apply the contrapositive to either direction — the two halves are proved independently, and each one is allowed to choose its easiest form.
Related: Proof by Contrapositive · Logic and Propositions · Why the Contrapositive Is Always Equivalent but the Converse Isn't · Contrapositive vs Converse — The Swap That Secretly Changes the Theorem