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

Axiom ax-10o 1139
Description: Axiom ax-10o 1139 ("o" for "old") was the original version of ax-10 965, before it was discovered (in May 2008) that the shorter ax-10 965 could replace it. It appears as Axiom scheme C11' in [Megill] p. 448 (p. 16 of the preprint).

This axiom is redundant, as shown by theorem ax10o 1138.

Assertion
Ref Expression
ax-10o |- (A.x x = y -> (A.xph -> A.yph))

Detailed syntax breakdown of Axiom ax-10o
StepHypRef Expression
1 vx . . . . 5 set x
21cv 954 . . . 4 class x
3 vy . . . . 5 set y
43cv 954 . . . 4 class y
52, 4wceq 955 . . 3 wff x = y
65, 1wal 953 . 2 wff A.x x = y
7 wph . . . 4 wff ph
87, 1wal 953 . . 3 wff A.xph
97, 3wal 953 . . 3 wff A.yph
108, 9wi 3 . 2 wff (A.xph -> A.yph)
116, 10wi 3 1 wff (A.x x = y -> (A.xph -> A.yph))
Colors of variables: wff set class
This axiom is referenced by:  ax10 1140  hbae 1144  dvelimfALT 1152  dral1 1153  hbsb4 1247  a12stdy1 1371  a12stdy2 1372  a12stdy4 1374  hbeu 1388  nd1 4921  nd2 4922  axpowndlem3 4934
Copyright terms: Public domain