Description: Inference form of Theorem
19.23 of [Margaris] p. 90, see 19.23 2205.
See exlimi 2211 for a more general version requiring more
axioms.
This inference, along with its many variants such as rexlimdv 3213, is
used to implement a metatheorem called "Rule C" that is given
in many
logic textbooks. See, for example, Rule C in [Mendelson] p. 81, Rule C
in [Margaris] p. 40, or Rule C in
Hirst and Hirst's A Primer for Logic
and Proof p. 59 (PDF p. 65) at
http://www.appstate.edu/~hirstjl/primer/hirst.pdf 3213. In informal
proofs, the statement "Let 𝐶 be an element such that..."
almost
always means an implicit application of Rule C.
In essence, Rule C states that if we can prove that some element 𝑥
exists satisfying a wff, i.e. ∃𝑥𝜑(𝑥) where 𝜑(𝑥) has
𝑥 free, then we can use 𝜑(𝐶) as a hypothesis for the
proof
where 𝐶 is a new (fictitious) constant not
appearing previously in
the proof, nor in any axioms used, nor in the theorem to be proved. The
purpose of Rule C is to get rid of the existential quantifier.
We cannot do this in Metamath directly. Instead, we use the original
𝜑 (containing 𝑥) as an antecedent for
the main part of the
proof. We eventually arrive at (𝜑 → 𝜓) where 𝜓 is the
theorem to be proved and does not contain 𝑥. Then we apply
exlimiv 1934 to arrive at (∃𝑥𝜑 → 𝜓). Finally, we separately
prove ∃𝑥𝜑 and detach it with modus ponens ax-mp 5
to arrive at
the final theorem 𝜓, see exlimiiv 1935. (Contributed by NM,
21-Jun-1993.) Remove dependencies on ax-6 1972
and ax-8 2109. (Revised by
Wolf Lammen, 4-Dec-2017.) |