Hypothetical Syllogism

Formulation 2

 * $p \implies q, q \implies r, p \vdash r$

Formulation 3

 * $\vdash \left({\left({p \implies q}\right) \land \left({q \implies r}\right)}\right) \implies \left({p \implies r}\right)$

Formulation 4

 * $\vdash \left({p \implies q}\right) \implies \left({\left({q \implies r}\right) \implies \left({p \implies r}\right)}\right)$

Formulation 5

 * $\vdash \left({q \implies r}\right) \implies \left({\left({p \implies q}\right) \implies \left({p \implies r}\right)}\right)$

They can be seen to be logically equivalent to the forms above by application of the Extended Rule of Implication.

Some sources refer to these theorems as the principles of syllogism.

Proof by Natural Deduction
By the tableau method:

Proof of Alternative Renditions
Let us use substitution instances as follows:

First we show that:
 * $\left({\left({p \implies q}\right) \land \left({q \implies r}\right)}\right) \implies \left({p \implies r}\right)$

Using substitution instances leads us back to:
 * $\left({\left({p \implies q}\right) \land \left({q \implies r}\right)}\right) \implies \left({p \implies r}\right)$

From there, we have two more things to show:

Using substitution instances leads us back to:
 * $\vdash \left({p \implies q}\right) \implies \left({\left({q \implies r}\right) \implies \left({p \implies r}\right)}\right)$

Using substitution instances leads us back to:
 * $\vdash \left({q \implies r}\right) \implies \left({\left({p \implies q}\right) \implies \left({p \implies r}\right)}\right)$

Proof by Truth Table
We apply the Method of Truth Tables to the propositions in turn.

As can be seen for all models by inspection, where the truth values under the main connectives on the LHS is $T$, that under the one on the RHS is also $T$:

$\begin{array}{|ccccccc||ccc|} \hline (p & \implies & q) & \land & (q & \implies & r) & p & \implies & r \\ \hline F & T & F & T & F & T & F & F & T & F \\ F & T & F & T & F & T & T & F & T & T \\ F & T & T & F & T & F & F & F & T & F \\ F & T & T & T & T & T & T & F & T & T \\ T & F & F & F & F & T & F & T & F & F \\ T & F & F & F & F & T & T & T & T & T \\ T & T & T & F & T & F & F & T & F & F \\ T & T & T & T & T & T & T & T & T & T \\ \hline \end{array}$

Hence the result.

Also known as
It is otherwise known as the transitivity law.

Its abbreviation in a tableau proof is $\textrm{HS}$.