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

Theorem iunex 3863
Description: The existence of an indexed union. x is normally a free-variable parameter in the class expression substituted for B, which can be read informally as B(x).
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:   x,A

Proof of Theorem iunex
StepHypRef Expression
1 iunex.1 . 2 |- A e. V
2 iunex.2 . . . 4 |- B e. V
32a1i 8 . . 3 |- (x e. A -> B e. V)
43rgen 1698 . 2 |- A.x e. A B e. V
5 iunexg 3862 . 2 |- ((A e. V /\ A.x e. A B e. V) -> U_x e. A B e. V)
61, 4, 5mp2an 697 1 |- U_x e. A B e. V
Colors of variables: wff set class
Syntax hints:   e. wcel 958  A.wral 1645  Vcvv 1811  U_ciun 2566
This theorem is referenced by:  abrexex2 3871  ixpssmap 4363  tz9.1 4646  cplem2 4721
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-9 965  ax-10 966  ax-11 967  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-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-rep 2693  ax-sep 2703  ax-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-rab 1652  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-iun 2568  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fv 3198
Copyright terms: Public domain