Symbolic LogicRules of Replacement

Transposition and Material Implication (Trans, Impl)

Trans: p → q :: ¬q → ¬p. Impl: p → q :: ¬p ∨ q.

Not started Jump to practice

Two rules of replacement deal with conditionals. Transposition (Trans) turns a conditional into its contrapositive, which you know is equivalent from Converse, Inverse and Contrapositive. Material implication (Impl) turns a conditional into a disjunction. They extend Commutation, Association and Distribution (Com, Assoc, Dist).

Transposition and material implication.
RuleFormForm
Trans$p \to q$$\neg q \to \neg p$
Impl$p \to q$$\neg p \lor q$

Key idea

Trans: a conditional may be replaced by its contrapositive (swap the parts and negate both), and back. Impl: $p \to q$ may be replaced by $\neg p \lor q$, and back.

Why it works

Both pairs have the same truth table: $p \to q$, $\neg q \to \neg p$ and $\neg p \lor q$ are each false only when $p$ is true and $q$ is false. Impl says a conditional amounts to "either the antecedent fails or the consequent holds", which is the promise reading of Truth Values of the Connectives in other words. These rules let you move between conditionals and disjunctions, so MP, MT, DS and HS can all reach the same information.
Three equivalent columns.

Worked examples

Worked example: Transposition

Apply Trans to $r \to \neg s$.
  1. Swap the parts and negate both: $\neg \neg s \to \neg r$.
  2. DN may then simplify $\neg \neg s$ to $s$ in another step.

Answer: $\neg \neg s \to \neg r$

Worked example: Material implication

Apply Impl to $\neg p \lor q$ to get a conditional.
  1. Read Impl right to left: $\neg p \lor q$ :: $p \to q$.

Answer: $p \to q$

Worked example: Impl in a proof

Premises $p \to q$ and $\neg q \lor r$. Prove $p \to r$.
  1. Line 3: $q \to r$ by Impl 2 (since $\neg q \lor r$ :: $q \to r$).
  2. Line 4: $p \to r$ by HS 1, 3.

Answer: Two lines.

Common mistake

Transposing without negating both sides (that gives the converse $q \to p$, which is not equivalent), or writing Impl as $p \lor \neg q$. Impl negates the antecedent: $p \to q$ :: $\neg p \lor q$. A quick check: put $p$ T, $q$ F into your result. It must come out F, as the conditional does.

Worked example: Trans in a proof

Premises $p \to q$ and $\neg q \to r$. Prove $\neg p \to r$?
  1. Careful: HS needs the consequent of one conditional to be the antecedent of the other.
  2. Trans turns $p \to q$ into $\neg q \to \neg p$, which chains with nothing here.
  3. Instead, Trans on $\neg q \to r$ gives $\neg r \to \neg \neg q$; that does not help either.

Answer: This argument is actually invalid (try $p$ F, $q$ T, $r$ F). Not every pair of conditionals chains.

Worked example: Trans that works

Premises $p \to q$ and $\neg p \to r$. Prove $\neg q \to r$.
  1. Line 3: $\neg q \to \neg p$ by Trans 1.
  2. Line 4: $\neg q \to r$ by HS 3, 2.

Answer: Trans made the consequent $\neg p$ match the antecedent of premise 2.

The lesson of that example: before reshaping, check that the argument is valid. A short truth table takes a minute and can save a long search for a proof that does not exist.

Impl also explains why $p \lor q$ is equivalent to $\neg p \to q$: replace $p$ by $\neg p$ in the rule, giving $\neg p \to q$ :: $\neg \neg p \lor q$, and DN finishes the job. Translating "unless" as $\lor$ in Translating Conditionals rested on exactly this equivalence.

Practice

Pass with 3 right answers, the last 2 in a row. Each right answer earns 2 XP.

Loading practice…

Builds on

Leads to

Sources and further reading

  • Patrick J. Hurley and Lori Watson, A Concise Introduction to Logic, 13th ed., section 7.4, Rules of Replacement II
  • forall x: Calgary, an open introduction to formal logic (P. D. Magnus, Tim Button and others; Open Logic Project), chapter on derived rules
@teddyrookbook GitHub