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

Theorem ax11o 1215
Description: Derivation of set.mm's original ax-11o 1216 from the shorter ax-11 965 that has replaced it.

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

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

Theorem ax11 1217 shows the reverse derivation of ax-11 965 from ax-11o 1216.

This theorem should not be referenced in any proof. Instead, use ax-11o 1216 below so that theorems needing ax-11o 1216 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 965 . 2 |- (x = z -> (A.zph -> A.x(x = z -> ph)))
21ax11a2 1214 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 952   = wceq 954
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-9 963  ax-10 964  ax-11 965  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 979
Copyright terms: Public domain