Conditional Statements: Converse, Inverse, Contrapositive, and Biconditional

In the conditional "If an animal is a dog, then it is a mammal," the converse swaps the parts (if a mammal, then a dog), the inverse negates them (if not a dog, then not a mammal), and the contrapositive does both (if not a mammal, then not a dog). The contrapositive always has the same truth value as the original. The converse and inverse may not: here both are false, since a cat is a mammal, not a dog.

Converse, Inverse, and Contrapositive at a Glance

Every row below is built from the same two parts. Let p be "an animal is a dog" and q be "it is a mammal." The original statement p → q is true.

StatementFormSymbolExampleAlways same truth value as the original?
Conditional (original)If p, then qp → qIf an animal is a dog, then it is a mammal. (True)It is the original
ConverseIf q, then pq → pIf an animal is a mammal, then it is a dog. (False: a cat)No. It always matches the inverse instead.
InverseIf not p, then not q¬p → ¬qIf an animal is not a dog, then it is not a mammal. (False: a cat)No. It always matches the converse instead.
ContrapositiveIf not q, then not p¬q → ¬pIf an animal is not a mammal, then it is not a dog. (True)Yes, always
Biconditionalp if and only if qp ↔ qAn animal is a dog if and only if it is a mammal. (False: the converse fails)No. It also needs the converse to be true.

What Is a Statement in Logic?

A statement, also called a proposition, is a declarative sentence that is either true or false, but not both. "7 is prime" is a true statement. "Every even number is divisible by 4" is a false statement. Both count as statements, because each has a definite truth value.

Some sentences are not statements. "Is 7 prime?" is a question and "Close the door" is a command, so neither is true or false. An open sentence such as "x + 2 = 5" has no truth value until x is chosen: it is true when x = 3 and false for every other value. Logic uses letters such as p and q to stand for statements, then combines them with five connectives.

ConnectiveSymbolRead AsTrue When
Negation¬pnot pp is false
Conjunctionp ∧ qp and qboth p and q are true
Disjunctionp ∨ qp or qat least one of p and q is true
Conditionalp → qif p, then qevery case except p true and q false
Biconditionalp ↔ qp if and only if qp and q have the same truth value

And vs. Or: Conjunction and Disjunction

An and statement, p ∧ q, is true only when both parts are true. "7 is prime and 7 is odd" is true; "7 is prime and 7 is even" is false, because one false part is enough to make the whole conjunction false.

An or statement, p ∨ q, is true when at least one part is true. In mathematics "or" is inclusive: "7 is prime or 7 is odd" is true even though both parts are true. An or statement is false only when both parts are false. In a Venn diagram, "and" matches the overlap (intersection) of two circles, and "or" matches everything inside either circle (union).

pqp ∧ q (and)p ∨ q (or)
TTTT
TFFT
FTFT
FFFF

What Is a Conditional Statement?

A conditional statement has the form "if p, then q," written p → q. The part after "if" is the hypothesis (p), and the part after "then" is the conclusion (q). In "If an animal is a dog, then it is a mammal," the hypothesis is "an animal is a dog" and the conclusion is "it is a mammal."

A conditional makes one promise: whenever the hypothesis is true, the conclusion is true too. It is false only when the hypothesis is true and the conclusion is false. If the hypothesis is false, the statement promised nothing about that case, so the conditional counts as true. Logicians call this a vacuously true conditional. A conditional also says nothing about cause: it is a claim about truth values, not about one event producing another.

Conditionals often appear without the words "if" and "then." Each of these says the same thing as p → q:

  • q if p ("It is a mammal if it is a dog.")
  • p only if q ("An animal is a dog only if it is a mammal.")
  • p implies q
  • p is sufficient for q; q is necessary for p
  • All p are q ("All dogs are mammals.")

The phrase "only if" is the one most often misread. "p only if q" points from p to q, so it means p → q, not q → p.

Truth Table for If-Then Statements

A truth table lists every combination of truth values for the parts and the value of the whole statement in each case. Two parts give 2 × 2 = 4 rows. Take p as "it rains" and q as "the game is canceled," so p → q reads "If it rains, then the game is canceled."

pqp → qWhat Happened
TTTIt rained and the game was canceled. The promise was kept.
TFFIt rained and the game was played. The promise was broken.
FTTNo rain, but the game was canceled for another reason. Nothing was promised about dry days.
FFTNo rain and the game was played. The promise was not tested.

Only the second row is false. That single row is the key to everything else in this guide: a conditional is true exactly when the case "p true, q false" never happens. "If an animal is a dog, then it is a mammal" is true because no animal is a dog that is not a mammal. The same idea gives a useful rewrite: p → q has the same truth table as ¬p ∨ q ("not p, or q").

Converse, Inverse, and Contrapositive

Three new statements can be made from any conditional by swapping its parts, negating them, or doing both. Each is a separate claim, and each must be checked on its own.

Converse: Swap the Parts (q → p)

The converse of "if p, then q" is "if q, then p." For the running example: "If an animal is a mammal, then it is a dog." This is false, because a cat is a mammal and not a dog. A true conditional can have a false converse, so the converse never follows automatically from the original.

Inverse: Negate Both Parts (¬p → ¬q)

The inverse of "if p, then q" is "if not p, then not q." For the running example: "If an animal is not a dog, then it is not a mammal." This is also false, and the same cat shows it: a cat is not a dog, yet it is a mammal.

Contrapositive: Swap and Negate (¬q → ¬p)

The contrapositive of "if p, then q" is "if not q, then not p." For the running example: "If an animal is not a mammal, then it is not a dog." This is true. A lizard or a fish cannot be a dog, because every dog is a mammal. The contrapositive always agrees with the original.

A quick way to keep them apart: the converse reverses, the inverse negates, and the contrapositive does both. Negating without reversing gives the inverse, not the contrapositive, which is the most common slip when writing these by hand.

Is the Contrapositive Always True?

No. The contrapositive is always logically equivalent to the original statement, which means it is true exactly when the original is true and false exactly when the original is false. "If a number is even, then it is divisible by 4" is false (6 is even but not divisible by 4), and its contrapositive, "If a number is not divisible by 4, then it is not even," is false for the same reason: 6 is not divisible by 4, yet it is even.

The reason is that both statements are broken by exactly the same situation. The conditional p → q fails only when p is true and q is false. The contrapositive ¬q → ¬p fails only when ¬q is true and ¬p is false, which is the same situation: q false and p true. The converse and the inverse are both broken by the opposite situation, q true and p false, so they are equivalent to each other. In fact, the inverse is the contrapositive of the converse.

pqp → q (original)¬q → ¬p (contrapositive)q → p (converse)¬p → ¬q (inverse)
TTTTTT
TFFFTT
FTTTFF
FFTTTT

The original and contrapositive columns match in every row, and so do the converse and inverse columns. The original and converse columns do not match, which is why a true statement can have a false converse. This equivalence is also what makes proof by contrapositive work: proving ¬q → ¬p proves p → q.

What Is a Biconditional Statement?

A biconditional, written p ↔ q, is read "p if and only if q" (often shortened to "p iff q"). It combines a conditional with its converse: p ↔ q means p → q and q → p. It is true when p and q have the same truth value, both true or both false, and false when they differ.

pqp → qq → pp ↔ q
TTTTT
TFFTF
FTTFF
FFTTT

"A whole number is even if and only if it is divisible by 2" is a true biconditional: each direction holds. "An animal is a dog if and only if it is a mammal" is false, because its converse fails. Note the last row of the table: when p and q are both false, the biconditional is true, since the two parts still match.

The words matter. "p if q" means q → p, "p only if q" means p → q, and "p if and only if q" claims both. To prove a biconditional, you prove two conditionals, one in each direction.

How to Negate a Statement

The negation of p, written ¬p, is the statement that is true exactly when p is false. The test for any negation is simple: the original and its negation must never be true together and never be false together. The negation of "9 is prime" is "9 is not prime." The negation of "the water is hot" is "the water is not hot," not "the water is cold": water can be neither hot nor cold.

Statements with "all," "some," and "none" need the most care. These words are quantifiers, and negating a statement switches "all" with "some" and moves the "not" inside: "not all are" means "at least one is not," and "not some are" means "none are."

StatementCorrect NegationNot the Negation
All students passed.At least one student did not pass.No student passed.
Some numbers are negative.No number is negative.Some numbers are not negative.
No prime number is even.At least one prime number is even.All prime numbers are even.
It is raining and it is cold.It is not raining or it is not cold.It is not raining and it is not cold.
x = 2 or x = 3.x ≠ 2 and x ≠ 3.x ≠ 2 or x ≠ 3.
If it rains, then the game is canceled.It rains and the game is not canceled.If it rains, then the game is not canceled.

In symbols, the and/or rows are De Morgan's laws: ¬(p ∧ q) is equivalent to ¬p ∨ ¬q, and ¬(p ∨ q) is equivalent to ¬p ∧ ¬q. The last row follows from the truth table above: since p → q is false only when p is true and q is false, its negation is p ∧ ¬q. The negation of a conditional is an "and" statement, not another conditional.

How to Use a Counterexample to Show a Conditional Is False

A general conditional such as "if n is a prime number, then n is odd" is a claim about every case. To prove it false, you need only one counterexample: a single case where the hypothesis is true and the conclusion is false. Here n = 2 works, because 2 is prime and 2 is not odd. That one number settles the question.

A valid counterexample must satisfy the hypothesis. The number 9 is odd and not prime, but it does not test the claim at all, because the claim says nothing about numbers that are not prime. Confirming examples do not help either: 3, 5, and 7 are prime and odd, yet any number of such cases can never prove a statement about all primes. That takes a proof.

The same method shows that a converse is false. To disprove the converse q → p, find a case where q is true and p is false. For "if an animal is a mammal, then it is a dog," a cat is that case.

Conditional Statements in Geometry Proofs

Definitions Are Biconditionals

A good definition works in both directions. "Two lines are perpendicular if and only if they intersect to form right angles" lets you go from perpendicular lines to right angles, and from right angles back to perpendicular lines. Likewise, "M is the midpoint of segment AB if and only if M lies on AB and AM = MB." That two-way use is why a definition can be cited as a reason in either direction of a proof.

Theorems and Their Converses Are Proved Separately

Most theorems are conditionals. The Pythagorean theorem says that if a triangle is a right triangle with legs a and b and hypotenuse c, then a² + b² = c². Its converse, that a triangle whose sides satisfy a² + b² = c² is a right triangle, is also true, but it needed its own proof. That converse is what lets you conclude that a 3-4-5 triangle has a right angle. Other converses fail: vertical angles are congruent, but congruent angles need not be vertical angles.

Every Step Uses a Conditional

Each reason in a two-column proof is a definition, postulate, or theorem, and each is an if-then statement whose hypothesis you have already established. Geometry courses name the two basic patterns. The Law of Detachment: if p → q is true and p is true, then q is true. The Law of Syllogism: if p → q and q → r are both true, then p → r is true. Citing a converse that has not been proved is one of the most common errors in student proofs.

Indirect Proof Relies on the Contrapositive

When a direct proof of p → q is awkward, you can prove the contrapositive ¬q → ¬p instead, since the two are equivalent. A proof by contradiction is a close relative: assume p is true and q is false, the one case that would break the conditional, and show that this assumption leads to something impossible.

Worked Examples

Example 1: Write the Converse, Inverse, and Contrapositive

Statement: "If two angles are vertical angles, then they are congruent." This is the vertical angles theorem, so it is true.

Converse: If two angles are congruent, then they are vertical angles. False. Two corners of a rectangle are both 90°, so they are congruent, but they are not vertical angles.
Inverse: If two angles are not vertical angles, then they are not congruent. False. The same two corners are not vertical angles, yet they are congruent.
Contrapositive: If two angles are not congruent, then they are not vertical angles. True, because it is equivalent to the original theorem.

Check: the converse and inverse share a truth value (false), and the original and contrapositive share a truth value (true), as they always must.

Example 2: Find a Counterexample

Claim: "If x² = 9, then x = 3."

Search: look for a value that makes the hypothesis true and the conclusion false. Try x = −3: (−3)² = 9, so the hypothesis holds, but −3 ≠ 3, so the conclusion fails.

Result: x = −3 is a counterexample, so the claim is false. By contrast, x = 4 is not a counterexample, because 4² = 16, so the hypothesis is false. The corrected statement, "x² = 9 if and only if x = 3 or x = −3," is a true biconditional.

Example 3: Rewrite a Definition as a Biconditional

Definition: "A right angle is an angle that measures 90°."

Conditional: If an angle is a right angle, then it measures 90°. (True)
Converse: If an angle measures 90°, then it is a right angle. (True)
Biconditional: An angle is a right angle if and only if it measures 90°.

Contrast: "If a quadrilateral is a square, then it has four right angles" is true, but its converse is false: a 2 × 5 rectangle has four right angles and is not a square. So "a quadrilateral is a square if and only if it has four right angles" is false and cannot serve as a definition. A correct version is "a quadrilateral is a square if and only if it has four right angles and four congruent sides."

Example 4: Prove a Statement Through Its Contrapositive

Claim: For every integer n, if n² is even, then n is even.

Contrapositive: If n is not even (that is, n is odd), then n² is not even (n² is odd). This version is easier to prove. Write n = 2k + 1 for some integer k. Then n² = 4k² + 4k + 1 = 2(2k² + 2k) + 1, which is one more than an even number, so n² is odd.

Conclusion: the contrapositive is true, so the original statement is true. Starting from "n² is even" directly gives no easy way to reach n.

Want to check your understanding?

Our interaction checks test whether you truly understand a concept — not just whether you can repeat a procedure.

Try an interaction check

Common Mistakes

Assuming the converse is true

"All squares are rectangles" is true, but "all rectangles are squares" is false. A conditional and its converse are different claims, and the truth of one tells you nothing about the other. Before using a converse, check it separately, or find the case where q is true and p is false that breaks it.

Thinking the inverse is equivalent to the original

"If it is raining, then the ground is wet" is a reasonable claim, but its inverse, "If it is not raining, then the ground is not wet," fails as soon as a sprinkler runs. The inverse always matches the converse, not the original. Negating both parts without swapping them is the usual way students produce the inverse when they meant to write the contrapositive.

Negating "all are" as "none are"

The negation of "all students passed" is "at least one student did not pass," not "no student passed." If 29 of 30 students passed, both "all passed" and "none passed" are false, so they cannot be negations of each other. A correct negation is true in exactly the cases where the original is false.

Calling a conditional false because its hypothesis is false

"If you score 100 on the test, then you get a prize" is not broken when a student scores 80 and gets no prize. A conditional with a false hypothesis is true, because it made no promise about that case. The only row of the truth table that is false is the one with a true hypothesis and a false conclusion.

Next Steps: Explore Each Concept

Read Next

Frequently Asked Questions

What is the difference between the converse, inverse, and contrapositive?

Start from the conditional "if p, then q." The converse swaps the two parts (if q, then p), the inverse negates both parts (if not p, then not q), and the contrapositive swaps and negates them (if not q, then not p). Only the contrapositive is guaranteed to have the same truth value as the original statement.

Is the contrapositive always true?

No. The contrapositive is always logically equivalent to the original statement, so it is true exactly when the original is true and false exactly when the original is false. "If an animal is a dog, then it is a mammal" is true, and so is its contrapositive, "If an animal is not a mammal, then it is not a dog." A false conditional always has a false contrapositive.

Are the converse and the inverse logically equivalent?

Yes. The inverse is the contrapositive of the converse, so the two always have the same truth value: both are false exactly when q is true and p is false. Neither of them is equivalent to the original conditional, which is why a true statement can have a false converse and a false inverse.

When is a conditional statement false?

A conditional "if p, then q" is false in exactly one case: the hypothesis p is true and the conclusion q is false. In every other case, including every case in which p is false, the conditional is true. "If it rains, then the game is canceled" is broken only by a rainy day on which the game is still played.

What is a biconditional statement?

A biconditional, written p ↔ q and read "p if and only if q," states that p and q are both true or both false. It is true exactly when the conditional p → q and its converse q → p are both true. Definitions are biconditionals: an angle is a right angle if and only if it measures 90°.

How do you negate a statement with "all" or "some"?

The negation of "all are" is "at least one is not," and the negation of "some are" is "none are." So the negation of "All students passed" is "At least one student did not pass," not "No student passed." A correct negation is true in exactly the cases where the original statement is false.

How many rows does a truth table have?

A truth table for n basic statements has 2ⁿ rows, one for each combination of true and false values. Two statements, such as p and q, need 4 rows, and three statements need 8. In the truth table for p → q, only one of the four rows is false.

About Sense of Study

Sense of Study is a concept-first learning platform that helps students build deep understanding in math, physics, chemistry, statistics, and computational thinking. Our approach maps prerequisite relationships between concepts so students master foundations before moving forward — eliminating the gaps that cause confusion later.

With 800+ interconnected concepts and mastery tracking, we help students and parents see exactly where understanding breaks down and how to fix it.