Deduction Theorem for Hilbert Proof System for Predicate Logic

Theorem
Let $\mathscr H$ be instance 1 of a Hilbert proof system for predicate logic.

Then the deduction rule:


 * $\dfrac{U,\mathbf A \vdash \mathbf B}{U \vdash \mathbf A \implies \mathbf B}$

is a derived rule for provable consequences in $\mathscr H$.

Proof
For any proof of $U, \mathbf A \vdash \mathbf B$, we indicate how to transform it into a proof of $U \vdash \mathbf A \implies \mathbf B$ without using the deduction rule.

This is done by applying the Second Principle of Mathematical Induction to the length $n$ of the proof of $U,\mathbf A \vdash \mathbf B$.

By definition of $\mathscr H$, then one of the following must occur:


 * $\mathbf B \in U$
 * $\mathbf B$ is an axiom of $\mathscr H$
 * $\mathbf B = \mathbf A$
 * $\mathbf B$ is derived from Modus Ponens

In the first two cases, we can craft the following proof of $U \vdash \mathbf A \implies \mathbf B$:

Next, if $\mathbf B = \mathbf A$, then $\mathbf A \implies \mathbf B$ is a tautology, and hence satisfies axiom 1 of $\mathscr H$.

Lastly, suppose that $\mathbf B$ is derived from Modus Ponens, so that we have $\mathbf B'$ and $\mathbf B' \implies \mathbf B$ as provable consequences of $U, \mathbf A$.

By the induction hypothesis.