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

Theorem ax11o 1212
Description: Derivation of set.mm's original ax-11o 1213 from the shorter ax-11 964 that has replaced it.

An open problem is whether this theorem can be proved without relying on ax-16 1206 or ax-17 968.

Another open problem is whether this theorem can be proved without relying on ax-12 965 (see note in a12study 1371).

Theorem ax11 1214 shows the reverse derivation of ax-11 964 from ax-11o 1213.

This theorem should not be referenced in any proof. Instead, use ax-11o 1213 below so that theorems needing ax-11o 1213 can be more easily identified.

Assertion
Ref Expression
ax11o |- (-. A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))

Proof of Theorem ax11o
StepHypRef Expression
1 ax-11 964 . 2 |- (x = z -> (A.zph -> A.x(x = z -> ph)))
21ax11a2 1211 1 |- (-. A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 951   = wceq 953
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978
Copyright terms: Public domain