Building Short Proofs gave the main idea: work backward from the conclusion. This lesson turns it into a short checklist, with the cases that trip people up most.
Key idea
Why it works
| The conclusion is … | Likely last step | You will need |
|---|---|---|
| the consequent of a conditional premise | MP | that conditional's antecedent |
| the negation of an antecedent | MT | the negation of the consequent |
| a disjunct of a disjunction premise | DS | the negation of the other disjunct |
| a conjunct of a conjunction | Simp | the conjunction |
| a conjunction | Conj | each conjunct |
| a disjunction with a new letter | Add | one of its disjuncts |
| a conditional | HS | two conditionals that chain |
Worked examples
Worked example: Plan backward
- $r$ is the consequent of $t \to r$: last step MP, needing $t$.
- $t$ is the consequent of $s \to t$: MP again, needing $s$.
- $s$ is a premise.
Answer: Line 4: $t$ (MP 2, 3). Line 5: $r$ (MP 1, 4).
Worked example: A new letter
- $u$ is in no premise.
- Get $q$ by MP, then Add.
Answer: Line 3: $q$ (MP 1, 2). Line 4: $q \lor u$ (Add 3).
Worked example: Two goals
- Last step Conj: need $r$ and $s$.
- $r$: MP from $p \to r$ and $p$ (Simp 1).
- $s$: MP from $q \to s$ and $q$ (Simp 1).
Answer: Six lines: Simp, MP, Simp, MP, Conj.
When you are stuck, try writing the goal on scrap paper and asking which premise mentions it. If a premise mentions it inside a conditional, the other side of that conditional becomes your next goal. If none mentions it at all, look for Add. If two premises mention it, try each; one of the routes usually comes out shorter.
Common mistake