| Description: Axiom to quantify a
variable over a formula in which it does not occur.
Axiom C5 in [Megill] p. 444 (p. 11 of
the preprint). Also appears as
Axiom B6 (p. 75) of system S2 of [Tarski] p. 77 and Axiom C5-1 of
[Monk2] p. 113.
(This theorem simply repeats ax-5 1910 so that we can include the following
note, which applies only to the obsolete axiomatization.)
This axiom is logically redundant in the (logically complete)
predicate calculus axiom system consisting of ax-gen 1794, ax-c4 38880,
ax-c5 38879, ax-11 2157, ax-c7 38881, ax-7 2007, ax-c9 38886, ax-c10 38882, ax-c11 38883,
ax-8 2110, ax-9 2118, ax-c14 38887, ax-c15 38885, and ax-c16 38888: in that system,
we can derive any instance of ax-5 1910 not containing wff variables by
induction on formula length, using ax5eq 38928 and ax5el 38933 for the basis
together with hbn 2296, hbal 2167, and hbim 2300.
However, if we omit this
axiom, our development would be quite inconvenient since we could work
only with specific instances of wffs containing no wff variables - this
axiom introduces the concept of a setvar variable not occurring in a wff
(as opposed to just two setvar variables being distinct). (Contributed
by NM, 19-Aug-2017.) (New usage is discouraged.)
(Proof modification is discouraged.) |
