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

Theorem axun 2867
Description: Axiom of Union expressed with fewest number of different variables.
Assertion
Ref Expression
axun |- E.xA.y(E.x(y e. x /\ x e. z) -> y e. x)
Distinct variable group:   x,y,z

Proof of Theorem axun
StepHypRef Expression
1 ax-un 2866 . 2 |- E.xA.y(E.w(y e. w /\ w e. z) -> y e. x)
2 elequ2 1137 . . . . . . 7 |- (w = x -> (y e. w <-> y e. x))
3 elequ1 1136 . . . . . . 7 |- (w = x -> (w e. z <-> x e. z))
42, 3anbi12d 628 . . . . . 6 |- (w = x -> ((y e. w /\ w e. z) <-> (y e. x /\ x e. z)))
54cbvexv 1315 . . . . 5 |- (E.w(y e. w /\ w e. z) <-> E.x(y e. x /\ x e. z))
65imbi1i 186 . . . 4 |- ((E.w(y e. w /\ w e. z) -> y e. x) <-> (E.x(y e. x /\ x e. z) -> y e. x))
76albii 999 . . 3 |- (A.y(E.w(y e. w /\ w e. z) -> y e. x) <-> A.y(E.x(y e. x /\ x e. z) -> y e. x))
87exbii 1051 . 2 |- (E.xA.y(E.w(y e. w /\ w e. z) -> y e. x) <-> E.xA.y(E.x(y e. x /\ x e. z) -> y e. x))
91, 8mpbi 189 1 |- E.xA.y(E.x(y e. x /\ x e. z) -> y e. x)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223  A.wal 954   = wceq 956   e. wcel 958  E.wex 980
This theorem is referenced by:  uniex2 2869  axunndlem1 4947
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981
Copyright terms: Public domain