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

Theorem uniex2 2860
Description: The Axiom of Union using the standard abbreviation for union. Given any set x, its union y exists.
Assertion
Ref Expression
uniex2 |- E.y y = U.x
Distinct variable group:   x,y

Proof of Theorem uniex2
StepHypRef Expression
1 axun 2858 . . . 4 |- E.yA.z(E.y(z e. y /\ y e. x) -> z e. y)
2 eluni 2496 . . . . . . 7 |- (z e. U.x <-> E.y(z e. y /\ y e. x))
32imbi1i 186 . . . . . 6 |- ((z e. U.x -> z e. y) <-> (E.y(z e. y /\ y e. x) -> z e. y))
43albii 996 . . . . 5 |- (A.z(z e. U.x -> z e. y) <-> A.z(E.y(z e. y /\ y e. x) -> z e. y))
54exbii 1047 . . . 4 |- (E.yA.z(z e. U.x -> z e. y) <-> E.yA.z(E.y(z e. y /\ y e. x) -> z e. y))
61, 5mpbir 190 . . 3 |- E.yA.z(z e. U.x -> z e. y)
76bm1.3ii 2696 . 2 |- E.yA.z(z e. y <-> z e. U.x)
8 dfcleq 1463 . . 3 |- (y = U.x <-> A.z(z e. y <-> z e. U.x))
98exbii 1047 . 2 |- (E.y y = U.x <-> E.yA.z(z e. y <-> z e. U.x))
107, 9mpbir 190 1 |- E.y y = U.x
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 951   = wceq 953   e. wcel 955  E.wex 977  U.cuni 2493
This theorem is referenced by:  uniex 2861
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-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-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-un 2857
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-clab 1457  df-cleq 1462  df-clel 1465  df-v 1803  df-uni 2494
Copyright terms: Public domain