Theorem iunss1 3877

Description: Subclass theorem for indexed union. (Contributed by NM, 10-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)

Assertion

Ref	Expression
iunss1	|- ( A C_ B -> U_ x e. A C C_ U_ x e. B C )

Distinct variable groups:   x, A   x, B

Allowed substitution hint:   C( x)

Proof of Theorem iunss1

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrexv 3207	. . 3 |- ( A C_ B -> ( E. x e. A y e. C -> E. x e. B y e. C ) )
2		eliun 3870	. . 3 |- ( y e. U_ x e. A C <-> E. x e. A y e. C )
3		eliun 3870	. . 3 |- ( y e. U_ x e. B C <-> E. x e. B y e. C )
4	1, 2, 3	3imtr4g 204	. 2 |- ( A C_ B -> ( y e. U_ x e. A C -> y e. U_ x e. B C ) )
5	4	ssrdv 3148	1 |- ( A C_ B -> U_ x e. A C C_ U_ x e. B C )

Syntax hints:   -> wi 4   e. wcel 2136   E.wrex 2445   C_ wss 3116   U_ciun 3866

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-in 3122  df-ss 3129  df-iun 3868

This theorem is referenced by:  iuneq1  3879  iunxdif2  3914  fsumiun  11418