Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ax17o Unicode version

Theorem ax17o 2096
 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-17 1603 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 1533, ax-5o 2075, ax-4 2074, ax-7 1708, ax-6o 2076, ax-8 1643, ax-12o 2081, ax-9o 2077, ax-10o 2078, ax-13 1686, ax-14 1688, ax-15 2082, ax-11o 2080, and ax-16 2083: in that system, we can derive any instance of ax-17 1603 not containing wff variables by induction on formula length, using ax17eq 2122 and ax17el 2128 for the basis together hbn 1720, hbal 1710, and hbim 1725. 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 set variable not occurring in a wff (as opposed to just two set variables being distinct). (Contributed by NM, 19-Aug-2017.) (New usage is discouraged.) (Proof modification discouraged.)
Assertion
Ref Expression
ax17o
Distinct variable group:   ,

Proof of Theorem ax17o
StepHypRef Expression
1 ax-17 1603 1
 Colors of variables: wff set class Syntax hints:   wi 4  wal 1527 This theorem was proved from axioms:  ax-17 1603
 Copyright terms: Public domain W3C validator