cs.thefarshad
medium

Derived Rules & Strategy

Shortcut rules — modus tollens, disjunctive syllogism, De Morgan — and how to plan a proof.

The introduction/elimination rules are enough to prove everything valid, but bare derivations get long. Derived rules are shortcuts: each is justified once by a little derivation from the primitive rules, and thereafter used as a single step. They add no power — anything provable with them is provable without — only convenience.

The proof player below shows the derivations that license several derived rules. Switch examples to see each one built from primitives.

GivenP → Q¬Q
Prove¬P
Strategy: The goal is a negation ¬P, so assume P, reach a contradiction, conclude ¬P (¬I).
Try the derivation yourself first, then reveal the step-by-step proof.

Common derived rules

RuleFromInferBuilt from
Modus tollens (MT)P→Q, ¬QP \rightarrow Q,\ \lnot Q¬P\lnot Preductio (¬\lnotI)
Disjunctive syllogism (DS)P∨Q, ¬PP \lor Q,\ \lnot PQQ∨\lorE
Hypothetical syllogismP→Q, Q→RP \rightarrow Q,\ Q \rightarrow RP→RP \rightarrow R→\rightarrowI
Double negation (DN)¬¬P\lnot\lnot PPP¬\lnotE
Contraposition (CP)P→QP \rightarrow Q¬Q→¬P\lnot Q \rightarrow \lnot P→\rightarrowI + reductio
De Morgan (DM)¬(P∨Q)\lnot(P \lor Q)¬P∧¬Q\lnot P \land \lnot Q¬\lnotI twice
Argument by cases (AC)P∨Q, P→R, Q→RP \lor Q,\ P\rightarrow R,\ Q\rightarrow RRR∨\lorE

The “De Morgan” and “Proof by cases” examples in the player are full primitive derivations of two of these.

How to plan a derivation

Proof search has a reliable shape — let the goal’s main connective pick the strategy:

  • Goal X→YX \rightarrow Y → start a subderivation assuming XX, aim for YY, close with →\rightarrowI.
  • Goal ¬X\lnot X → assume XX, aim for a contradiction, close with ¬\lnotI.
  • Goal X∧YX \land Y → prove XX and YY separately, combine with ∧\landI.
  • Goal X∨YX \lor Y → often easiest by reductio, or by ∨\lorI if you can prove a disjunct.
  • Stuck? Work forwards from the premises (eliminate connectives) until the two ends meet.

Takeaways

  • Derived rules are convenience shortcuts justified by primitive derivations; they add no logical power.
  • Know MT, DS, hypothetical syllogism, double negation, contraposition, De Morgan, argument by cases.
  • Strategy: let the goal’s main connective choose the rule, plan backwards, derive forwards.

References

  • Paul Teller, A Modern Formal Logic Primer, Prentice Hall (1989) — free at tellerprimer.ucdavis.edu, which introduces these derived rules (MT, DS, AC, DM, CP). Explanations and proofs here are original.