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

Theorem axun2 2859
Description: A variant of the Axiom of Union ax-un 2857. For any set x, there exists a set y whose members are exactly the members of the members of x i.e. the union of x. Axiom Union of [BellMachover] p. 466.
Assertion
Ref Expression
axun2 |- E.yA.z(z e. y <-> E.w(z e. w /\ w e. x))
Distinct variable group:   x,w,y,z

Proof of Theorem axun2
StepHypRef Expression
1 ax-un 2857 . 2 |- E.yA.z(E.w(z e. w /\ w e. x) -> z e. y)
21bm1.3ii 2696 1 |- E.yA.z(z e. y <-> E.w(z e. w /\ w e. x))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223  A.wal 951   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-12 965  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-sep 2693  ax-un 2857
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978
Copyright terms: Public domain