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

Theorem axun 2923
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 2922 . 2 |- E.xA.y(E.w(y e. w /\ w e. z) -> y e. x)
2 elequ2 1179 . . . . . . 7 |- (w = x -> (y e. w <-> y e. x))
3 elequ1 1178 . . . . . . 7 |- (w = x -> (w e. z <-> x e. z))
42, 3anbi12d 639 . . . . . 6 |- (w = x -> ((y e. w /\ w e. z) <-> (y e. x /\ x e. z)))
54cbvexv 1357 . . . . 5 |- (E.w(y e. w /\ w e. z) <-> E.x(y e. x /\ x e. z))
65imbi1i 193 . . . 4 |- ((E.w(y e. w /\ w e. z) -> y e. x) <-> (E.x(y e. x /\ x e. z) -> y e. x))
76albii 1040 . . 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 1092 . 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 196 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 230  A.wal 995   = wceq 997   e. wcel 999  E.wex 1021
This theorem is referenced by:  uniex2 2925  axunndlem1 5012
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1003  ax-gen 1004  ax-8 1005  ax-12 1009  ax-13 1010  ax-14 1011  ax-17 1012  ax-4 1014  ax-5o 1016  ax-6o 1019  ax-9o 1164  ax-un 2922
This theorem depends on definitions:  df-bi 154  df-an 232  df-ex 1022
Copyright terms: Public domain