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

Theorem zfext2 1438
Description: A generalization of the Axiom of Extensionality in which x and y need not be distinct.
Assertion
Ref Expression
zfext2 |- (A.z(z e. x <-> z e. y) -> x = y)
Distinct variable groups:   x,z   y,z

Proof of Theorem zfext2
StepHypRef Expression
1 a9e 1112 . 2 |- E.w w = x
2 ax-ext 1436 . . . 4 |- (A.z(z e. w <-> z e. y) -> w = y)
3 elequ2 1124 . . . . . . 7 |- (w = x -> (z e. w <-> z e. x))
43bibi1d 617 . . . . . 6 |- (w = x -> ((z e. w <-> z e. y) <-> (z e. x <-> z e. y)))
54albidv 1260 . . . . 5 |- (w = x -> (A.z(z e. w <-> z e. y) <-> A.z(z e. x <-> z e. y)))
6 equequ1 1121 . . . . 5 |- (w = x -> (w = y <-> x = y))
75, 6imbi12d 624 . . . 4 |- (w = x -> ((A.z(z e. w <-> z e. y) -> w = y) <-> (A.z(z e. x <-> z e. y) -> x = y)))
82, 7mpbii 193 . . 3 |- (w = x -> (A.z(z e. x <-> z e. y) -> x = y))
9819.23aiv 1277 . 2 |- (E.w w = x -> (A.z(z e. x <-> z e. y) -> x = y))
101, 9ax-mp 7 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 950  E.wex 956   = wceq 1099   e. wcel 1105
This theorem is referenced by:  axextnd 4866
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-gen 955  ax-8 1101  ax-9 1102  ax-12 1104  ax-14 1108  ax-17 1190  ax-ext 1436
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 957
Copyright terms: Public domain