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

Theorem axextnd 6095
Description: A version of the Axiom of Extensionality with no distinct variable conditions.
Assertion
Ref Expression
axextnd |- E.x((x e. y <-> x e. z) -> y = z)

Proof of Theorem axextnd
StepHypRef Expression
1 hbnae 1507 . . . . . . . 8 |- (-. A.x x = y -> A.x -. A.x x = y)
2 hbnae 1507 . . . . . . . 8 |- (-. A.x x = z -> A.x -. A.x x = z)
31, 2hban 1356 . . . . . . 7 |- ((-. A.x x = y /\ -. A.x x = z) -> A.x(-. A.x x = y /\ -. A.x x = z))
4 dveel2 1748 . . . . . . . . 9 |- (-. A.x x = y -> (w e. y -> A.x w e. y))
54adantr 425 . . . . . . . 8 |- ((-. A.x x = y /\ -. A.x x = z) -> (w e. y -> A.x w e. y))
6 dveel2 1748 . . . . . . . . 9 |- (-. A.x x = z -> (w e. z -> A.x w e. z))
76adantl 424 . . . . . . . 8 |- ((-. A.x x = y /\ -. A.x x = z) -> (w e. z -> A.x w e. z))
83, 5, 7hbbid 1470 . . . . . . 7 |- ((-. A.x x = y /\ -. A.x x = z) -> ((w e. y <-> w e. z) -> A.x(w e. y <-> w e. z)))
9 elequ1 1496 . . . . . . . . 9 |- (w = x -> (w e. y <-> x e. y))
10 elequ1 1496 . . . . . . . . 9 |- (w = x -> (w e. z <-> x e. z))
119, 10bibi12d 691 . . . . . . . 8 |- (w = x -> ((w e. y <-> w e. z) <-> (x e. y <-> x e. z)))
1211a1i 8 . . . . . . 7 |- ((-. A.x x = y /\ -. A.x x = z) -> (w = x -> ((w e. y <-> w e. z) <-> (x e. y <-> x e. z))))
133, 8, 12cbvald 1702 . . . . . 6 |- ((-. A.x x = y /\ -. A.x x = z) -> (A.w(w e. y <-> w e. z) <-> A.x(x e. y <-> x e. z)))
14 axext3 1867 . . . . . 6 |- (A.w(w e. y <-> w e. z) -> y = z)
1513, 14syl6bir 232 . . . . 5 |- ((-. A.x x = y /\ -. A.x x = z) -> (A.x(x e. y <-> x e. z) -> y = z))
16 19.8a 1376 . . . . 5 |- (y = z -> E.x y = z)
1715, 16syl6 25 . . . 4 |- ((-. A.x x = y /\ -. A.x x = z) -> (A.x(x e. y <-> x e. z) -> E.x y = z))
1817ex 402 . . 3 |- (-. A.x x = y -> (-. A.x x = z -> (A.x(x e. y <-> x e. z) -> E.x y = z)))
19 a9e 1483 . . . . 5 |- E.x x = z
20 hbae 1505 . . . . . 6 |- (A.x x = y -> A.xA.x x = y)
21 ax-8 1306 . . . . . . 7 |- (x = y -> (x = z -> y = z))
2221a4s 1330 . . . . . 6 |- (A.x x = y -> (x = z -> y = z))
2320, 22eximd 1410 . . . . 5 |- (A.x x = y -> (E.x x = z -> E.x y = z))
2419, 23mpi 55 . . . 4 |- (A.x x = y -> E.x y = z)
2524a1d 15 . . 3 |- (A.x x = y -> (A.x(x e. y <-> x e. z) -> E.x y = z))
26 a9e 1483 . . . . 5 |- E.x x = y
27 hbae 1505 . . . . . 6 |- (A.x x = z -> A.xA.x x = z)
28 ax-8 1306 . . . . . . . 8 |- (x = z -> (x = y -> z = y))
29 equcomi 1487 . . . . . . . 8 |- (z = y -> y = z)
3028, 29syl6 25 . . . . . . 7 |- (x = z -> (x = y -> y = z))
3130a4s 1330 . . . . . 6 |- (A.x x = z -> (x = y -> y = z))
3227, 31eximd 1410 . . . . 5 |- (A.x x = z -> (E.x x = y -> E.x y = z))
3326, 32mpi 55 . . . 4 |- (A.x x = z -> E.x y = z)
3433a1d 15 . . 3 |- (A.x x = z -> (A.x(x e. y <-> x e. z) -> E.x y = z))
3518, 25, 34pm2.61ii 144 . 2 |- (A.x(x e. y <-> x e. z) -> E.x y = z)
363519.35ri 1428 1 |- E.x((x e. y <-> x e. z) -> y = z)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 163   /\ wa 240  A.wal 1296   = wceq 1298   e. wcel 1300  E.wex 1326
This theorem is referenced by:  zfcndext 6117  axextprim 13785  axextdfeq 13864  axextndbi 13871
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-an 242  df-ex 1327
Copyright terms: Public domain