Courses / Mathematics I
Mathematical Language and Reasoning

Implication and Equivalence

The implication (conditional) p q, read as "if p then q," is the core connective of mathematical theorems.

Mathematics I 279 words Free to read

Implication and Truth

The implication (conditional) pqp \to q, read as "if pp then qq," is the core connective of mathematical theorems. Here, pp is the hypothesis and qq is the conclusion.

An implication is false in exactly one case: when pp is true and qq is false. In all other cases it is true.

Hypothesis (pp)Conclusion (qq)pqp \to qTruth Status
TrueTrueTrueNormal
TrueFalseFalseThe only failure
FalseTrueTrueVacuously true
FalseFalseTrueVacuously true

When pp is false, the implication is vacuously true regardless of qq. A false premise never makes an implication false; only a true hypothesis paired with a false conclusion does.

A conditional as a circuit: the wire that gets cut before it can fail

Derived Statements and Equivalence

From any implication pqp \to q, we form three related statements:

TypeFormStatus
Converseqpq \to pNot equivalent
Inverse¬p¬q\neg p \to \neg qNot equivalent
Contrapositive¬q¬p\neg q \to \neg pLogically equivalent

Common pitfall: Confusing an implication with its converse (qpq \to p) is a major error. pqp \to q does not guarantee qpq \to p.

The biconditional pqp \leftrightarrow q, meaning "pp if and only if qq" (iff), asserts that both pp and qq share the exact same truth value. It is true precisely when both pqp \to q and its converse qpq \to p hold simultaneously.

Practise this lesson

The explanation above is free to read. The graded practice for this lesson lives in the Tryals app.

11practice questions
2interactive scenes

Mathematical Language and Reasoning