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

Theorem iunex 2914
Description: The existence of an indexed union. x is normally a free-variable parameter in B.
Hypotheses
Ref Expression
iunex.1 |- A e. V
iunex.2 |- B e. V
Assertion
Ref Expression
iunex |- U.x e. A B e. V
Distinct variable group(s):   x,A

Proof of Theorem iunex
StepHypRef Expression
1 iunex.2 . . 3 |- B e. V
21dfiun2 2014 . 2 |- U.x e. A B = U.{y | E.x e. A y = B}
3 iunex.1 . . . 4 |- A e. V
43abrexex 2912 . . 3 |- {y | E.x e. A y = B} e. V
54uniex 1947 . 2 |- U.{y | E.x e. A y = B} e. V
62, 5eqeltr 1159 1 |- U.x e. A B e. V
Colors of variables: wff set class
Syntax hints:  {cab 1090   = wceq 1091   e. wcel 1092  E.wrex 1202  Vcvv 1348  U.cuni 1919  U.ciun 1994
This theorem is referenced by:  abrexex2 2915  tz9.1 3490  cplem2 3546
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-rab 1208  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-iun 1996  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fv 2438
metamath.org