| 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 1911 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 1797, ax-c4 36180,
ax-c5 36179, ax-11 2158, ax-c7 36181, ax-7 2015, ax-c9 36186, ax-c10 36182, ax-c11 36183,
ax-8 2113, ax-9 2121, ax-c14 36187, ax-c15 36185, and ax-c16 36188: in that system,
we can derive any instance of ax-5 1911 not containing wff variables by
induction on formula length, using ax5eq 36228 and ax5el 36233 for the basis
together with hbn 2299, hbal 2171, and hbim 2303.
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.) |
