HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Axiom ax-15 1109
Description: Axiom of Quantifier Introduction. One of the equality and substitution axioms for a non-logical predicate in our predicate calculus with equality. Axiom scheme C14' in [Megill] p. 448 (p. 16 of the preprint). It is redundant if we include ax-17 1190; see theorem ax15 1339. Alternately, ax-17 1190 becomes unnecessary in principle with this axiom, but we lose the more powerful metalogic afforded by ax-17 1190. We retain ax-15 1109 here to provide completeness for systems with the simpler metalogic that results from omitting ax-17 1190, which might be easier to study for some theoretical purposes.
Assertion
Ref Expression
ax-15 |- (-. A.z z = x -> (-. A.z z = y -> (x e. y -> A.z x e. y)))

Detailed syntax breakdown of Axiom ax-15
StepHypRef Expression
1 vz . . . . . 6 set z
21cv 1098 . . . . 5 class z
3 vx . . . . . 6 set x
43cv 1098 . . . . 5 class x
52, 4wceq 1099 . . . 4 wff z = x
65, 1wal 950 . . 3 wff A.z z = x
76wn 2 . 2 wff -. A.z z = x
8 vy . . . . . . 7 set y
98cv 1098 . . . . . 6 class y
102, 9wceq 1099 . . . . 5 wff z = y
1110, 1wal 950 . . . 4 wff A.z z = y
1211wn 2 . . 3 wff -. A.z z = y
134, 9wcel 1105 . . . 4 wff x e. y
1413, 1wal 950 . . . 4 wff A.z x e. y
1513, 14wi 3 . . 3 wff (x e. y -> A.z x e. y)
1612, 15wi 3 . 2 wff (-. A.z z = y -> (x e. y -> A.z x e. y))
177, 16wi 3 1 wff (-. A.z z = x -> (-. A.z z = y -> (x e. y -> A.z x e. y)))
Colors of variables: wff set class
This axiom is referenced by:  ax17el 1196
Copyright terms: Public domain