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

Theorem ax11o 1219
Description: Derivation of set.mm's original ax-11o 1220 from the shorter ax-11 969 that has replaced it.

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

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

Theorem ax11 1221 shows the reverse derivation of ax-11 969 from ax-11o 1220.

This theorem should not be referenced in any proof. Instead, use ax-11o 1220 below so that theorems needing ax-11o 1220 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 969 . 2 |- (x = z -> (A.zph -> A.x(x = z -> ph)))
21ax11a2 1218 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 956   = wceq 958
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 983
Copyright terms: Public domain