The last three rules of replacement handle the biconditional, conditionals with conjunctions inside, and repeated parts. With them you have all ten, completing the list begun in Rules of Replacement and continued in Transposition and Material Implication (Trans, Impl).
| Rule | Form | Form |
|---|---|---|
| Equiv | $p \leftrightarrow q$ | $(p \to q) \land (q \to p)$ |
| Equiv | $p \leftrightarrow q$ | $(p \land q) \lor (\neg p \land \neg q)$ |
| Exp | $(p \land q) \to r$ | $p \to (q \to r)$ |
| Taut | $p$ | $p \lor p$ |
| Taut | $p$ | $p \land p$ |
Key idea
Why it works
Worked examples
Worked example: Equiv to get a conditional
- Line 3: $(p \to q) \land (q \to p)$ by Equiv 1.
- Line 4: $p \to q$ by Simp 3.
- Line 5: $q$ by MP 4, 2.
Answer: Three lines.
Worked example: Exportation
- Line 3: $r \to (s \to t)$ by Exp 1.
- Line 4: $s \to t$ by MP 3, 2.
Answer: Two lines.
Worked example: Taut after CD
- Line 3: $q \lor q$ by CD 1, 2.
- Line 4: $q$ by Taut 3.
Answer: CD, then Taut.
Common mistake
Each of these rules earns its place in proofs. Equiv is the only way to use a biconditional: no rule of inference cites one directly. Exp lets MP reach a consequent when you have the conjuncts of the antecedent on separate lines (with Exp you need only one at a time). Taut tidies up after CD when both conditionals lead to the same place.
- A biconditional you want to use: Equiv first.
- An antecedent that is a conjunction: consider Exp.
- A disjunction or conjunction of a formula with itself: Taut.
That completes the ten rules of replacement: DM, Com, Assoc, Dist, DN, Trans, Impl, Equiv, Exp and Taut. With the eight rules of inference, that makes eighteen. The next lesson puts them all to work together.