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

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

Proof of Theorem zfun
StepHypRef Expression
1 ax-un 3790 . 2 |- E.xA.y(E.w(y e. w /\ w e. z) -> y e. x)
2 elequ2 1497 . . . . . . 7 |- (w = x -> (y e. w <-> y e. x))
3 elequ1 1496 . . . . . . 7 |- (w = x -> (w e. z <-> x e. z))
42, 3anbi12d 690 . . . . . 6 |- (w = x -> ((y e. w /\ w e. z) <-> (y e. x /\ x e. z)))
54cbvexv 1697 . . . . 5 |- (E.w(y e. w /\ w e. z) <-> E.x(y e. x /\ x e. z))
65imbi1i 203 . . . 4 |- ((E.w(y e. w /\ w e. z) -> y e. x) <-> (E.x(y e. x /\ x e. z) -> y e. x))
76albii 1346 . . 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 1398 . 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 206 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 240  A.wal 1296   = wceq 1298   e. wcel 1300  E.wex 1326
This theorem is referenced by:  uniex2 3793  axunndlem1 6099
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-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-un 3790
This theorem depends on definitions:  df-bi 164  df-an 242  df-ex 1327
Copyright terms: Public domain