Conditional Statements and Implications

In this lesson you’ll learn how the if-then statement works in logic (including the part that surprises everyone), how to form the converse, inverse, and contrapositive of a conditional, which of those is equivalent to the original, and what a biconditional means.

A conditional statement, also called an implication, has the form “if $p$, then $q$.” We write it

$$p \rightarrow q$$

The part before the arrow, $p$, is the hypothesis or antecedent. The part after, $q$, is the conclusion or consequent.

Here’s the truth table, and it’s the one table in this whole subject worth staring at for a minute:

$p$	$q$	$p \rightarrow q$
T	T	T
T	F	F
F	T	T
F	F	T

An implication is false in exactly one case: when the hypothesis is true but the conclusion is false. That’s the only way a promise gets broken.

Laid out as a grid, the lopsidedness is obvious:

This is the part that feels wrong at first. Why should “if $p$ then $q$” be true when $p$ is false?

Think of an implication as a promise. Suppose a teacher says:

“If you score above 90, you get an A.”

When does that promise get broken? Only if you score above 90 and don’t get an A. That’s row 2.

• You score 95 and get an A. Promise kept. (Row 1)
• You score 95 and get a B. Promise broken. (Row 2)
• You score 70 and get an A. Maybe generous, but the promise said nothing about what happens below 90. Not broken. (Row 3)
• You score 70 and get a C. Nothing was promised about this case. Not broken. (Row 4)

An implication makes no claim at all about what happens when the hypothesis fails. So it can’t be violated there, and in logic “not violated” means true. When $p$ is false, the implication is called vacuously true.

“If pigs can fly, then $2 + 2 = 5$” is a true statement. Weird, but harmless, because pigs can’t fly so the claim never gets tested.

Compare the implication table to $\neg p \vee q$ from the truth tables lesson. They match. So:

$$p \rightarrow q \equiv \neg p \vee q$$

This is how you negate an implication. Apply De Morgan:

$$\neg(p \rightarrow q) \equiv \neg(\neg p \vee q) \equiv p \wedge \neg q$$

The negation of an if-then statement is not another if-then statement. It’s an AND. To deny “if $p$ then $q$,” you assert that $p$ happened and $q$ didn’t. That’s exactly the single false row.

Given $p \rightarrow q$, there are three standard variations:

Name	Form	Reads as
Original	$p \rightarrow q$	If $p$, then $q$
Converse	$q \rightarrow p$	If $q$, then $p$
Inverse	$\neg p \rightarrow \neg q$	If not $p$, then not $q$
Contrapositive	$\neg q \rightarrow \neg p$	If not $q$, then not $p$

The truth table:

$p$	$q$	$p \rightarrow q$	$q \rightarrow p$	$\neg p \rightarrow \neg q$	$\neg q \rightarrow \neg p$
T	T	T	T	T	T
T	F	F	T	T	F
F	T	T	F	F	T
F	F	T	T	T	T

Read the columns carefully:

• The contrapositive is equivalent to the original. Columns 3 and 6 match exactly.
• The converse is not. Rows 2 and 3 disagree.
• The inverse is not either. But notice the converse and inverse match each other, since each is the contrapositive of the other.

$$p \rightarrow q \equiv \neg q \rightarrow \neg p$$

The four statements pair up on the diagonals:

This single fact powers an entire proof technique, which is the next lesson. If a statement is awkward to prove directly, prove the contrapositive instead. It’s the same claim.

Mathematicians phrase $p \rightarrow q$ several ways, and they all mean the same thing:

• If $p$, then $q$
• $p$ implies $q$
• $p$ is sufficient for $q$ (having $p$ is enough to guarantee $q$)
• $q$ is necessary for $p$ ($p$ can’t happen without $q$)
• $q$ whenever $p$
• $p$ only if $q$

That last one trips people up. “You may enter only if you have a ticket” means having a ticket is necessary, so it translates to $\text{enter} \rightarrow \text{ticket}$, not the other way around.

The biconditional $p \leftrightarrow q$ means ”$p$ if and only if $q$,” often abbreviated iff. It’s true when both parts have the same truth value.

$p$	$q$	$p \leftrightarrow q$
T	T	T
T	F	F
F	T	F
F	F	T

It’s the same as asserting both directions at once:

$$p \leftrightarrow q \equiv (p \rightarrow q) \wedge (q \rightarrow p)$$

This is why proving an “if and only if” theorem always takes two proofs. You show $p$ forces $q$, then you show $q$ forces $p$.

Definitions in math are almost always biconditionals. “An integer is even if and only if it is divisible by 2” works in both directions, which is what makes it a definition rather than just a fact.

Example 1: Form all three variations.

Statement: “If a number is divisible by 6, then it is divisible by 3.” (True.)

• Converse: “If a number is divisible by 3, then it is divisible by 6.” False. 9 is divisible by 3 but not 6.
• Inverse: “If a number is not divisible by 6, then it is not divisible by 3.” False. Same counterexample, 9.
• Contrapositive: “If a number is not divisible by 3, then it is not divisible by 6.” True, as it must be, since it’s equivalent to the original.

Example 2: Negate an implication.

Negate: “If the alarm is armed, then the doors are locked.”

Solution. Using $\neg(p \rightarrow q) \equiv p \wedge \neg q$:

“The alarm is armed and the doors are not locked.”

A very common wrong answer is “if the alarm is armed, then the doors are not locked.” That’s a different statement entirely, and it isn’t the negation.

Example 3: Spot the fallacy.

A system logs: “If the disk is full, the backup fails.” The backup failed. Did the disk fill up?

Solution. No. That’s using the converse, which doesn’t follow. The backup could have failed for a dozen other reasons: network timeout, bad credentials, corrupt file.

This mistake is called affirming the consequent, or the converse error.

What would be valid: the backup succeeded, therefore the disk was not full. That’s the contrapositive, and it’s airtight.

Example 4: Translate necessary and sufficient.

“Being a square is sufficient for being a rectangle. Being a rectangle is necessary for being a square.”

Solution. Both sentences say the same thing:

$$\text{square} \rightarrow \text{rectangle}$$

The converse is false: a 3-by-5 rectangle is not a square. So this is a one-directional implication, not a biconditional.

Example 5: A biconditional.

Is this a valid biconditional? “An integer $n$ is even if and only if $n^2$ is even.”

Solution. Check both directions.

Forward: if $n$ is even then $n = 2k$, so $n^2 = 4k^2 = 2(2k^2)$, which is even. True.

Backward: if $n^2$ is even, is $n$ even? Yes, and the easiest argument is the contrapositive: if $n$ is odd, then $n = 2k+1$ and $n^2 = 4k^2 + 4k + 1 = 2(2k^2+2k) + 1$, which is odd. So an even $n^2$ forces an even $n$.

Both directions hold, so the biconditional is valid.

The converse error is probably the single most common reasoning mistake in ordinary life, and knowing its name makes it easy to catch.

Medical testing runs on this. “If you have the disease, the test comes back positive” does not mean “if the test comes back positive, you have the disease.” The gap between those two statements is the false positive rate, and misunderstanding it leads to real harm.

Legal reasoning is full of necessary-versus-sufficient distinctions. Meeting a residency requirement might be necessary for a benefit without being sufficient.

In programming, the contrapositive shows up as guard clauses. Instead of nesting the happy path inside a condition, you check the negation of the conclusion and bail out early. It’s the same logic, restructured for readability.

Debugging is contrapositive reasoning almost end to end. “If the config loaded, the version string would be set. The version string is empty. Therefore the config did not load.” That’s valid, and it eliminates a whole branch of the search.