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

Theorem zfcndext 4937
Description: Axiom of Extensionality, reproved from conditionless ZFC version and predicate calculus.
Assertion
Ref Expression
zfcndext |- (A.z(z e. x <-> z e. y) -> x = y)
Distinct variable group:   x,y,z

Proof of Theorem zfcndext
StepHypRef Expression
1 axextnd 4915 . . 3 |- E.z((z e. x <-> z e. y) -> x = y)
2119.35i 1072 . 2 |- (A.z(z e. x <-> z e. y) -> E.z x = y)
3 19.9v 1279 . 2 |- (E.z x = y <-> x = y)
42, 3sylib 198 1 |- (A.z(z e. x <-> z e. y) -> x = y)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 951   = wceq 953   e. wcel 955  E.wex 977
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-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-ext 1452
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978
Copyright terms: Public domain