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

Axiom ax-12 1104
Description: Axiom of Quantifier Introduction. One of the equality and substitution axioms of predicate calculus with equality. Informally, it says that whenever z is distinct from x and y, and x = y is true, then x = y quantified with z is also true. In other words, z is irrelevant to the truth of x = y. Axiom scheme C9' in [Megill] p. 448 (p. 16 of the preprint). It apparently does not otherwise appear in the literature but is easily proved from textbook predicate calculus by cases.

An open problem is whether this axiom is redundant. Note that the analogous axiom for the membership connective, ax-15 1109, has been shown to be redundant. It is also unknown whether this axiom can be replaced by a shorter formula. However, it can be derived from two slightly shorter formulas, as shown by a12study 1355.

Assertion
Ref Expression
ax-12 |- (-. A.z z = x -> (-. A.z z = y -> (x = y -> A.z x = y)))

Detailed syntax breakdown of Axiom ax-12
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, 9wceq 1099 . . . 4 wff x = y
1413, 1wal 950 . . . 4 wff A.z x = y
1513, 14wi 3 . . 3 wff (x = y -> A.z x = y)
1612, 15wi 3 . 2 wff (-. A.z z = y -> (x = y -> A.z x = y))
177, 16wi 3 1 wff (-. A.z z = x -> (-. A.z z = y -> (x = y -> A.z x = y)))
Colors of variables: wff set class
This axiom is referenced by:  equid 1113  hbae 1128  dvelimfALT 1136  equvini 1151  hbequid 1152  ax17eq 1195  hbsb4 1232  sbcom 1242  sbal1 1328  ax11eq 1340  ax11indalem 1345  a12stdy4 1352  a12lem1 1353  axrepndlem2 4868  axacndlem4 4885  axacnd 4887
Copyright terms: Public domain