Theorem 2iunin 4031

Description: Rearrange indexed unions over intersection. (Contributed by NM, 18-Dec-2008.)

Assertion

Ref	Expression
2iunin	|- U_ x e. A U_ y e. B ( C i^i D ) = ( U_ x e. A C i^i U_ y e. B D )

Distinct variable groups:   x, B   y, C   x, D   x, y

Allowed substitution hints:   A( x, y)   B( y)   C( x)   D( y)

Proof of Theorem 2iunin

Step	Hyp	Ref	Expression
1		iunin2 4028	. . . 4 |- U_ y e. B ( C i^i D ) = ( C i^i U_ y e. B D )
2	1	a1i 9	. . 3 |- ( x e. A -> U_ y e. B ( C i^i D ) = ( C i^i U_ y e. B D ) )
3	2	iuneq2i 3982	. 2 |- U_ x e. A U_ y e. B ( C i^i D ) = U_ x e. A ( C i^i U_ y e. B D )
4		iunin1 4029	. 2 |- U_ x e. A ( C i^i U_ y e. B D ) = ( U_ x e. A C i^i U_ y e. B D )
5	3, 4	eqtri 2250	1 |- U_ x e. A U_ y e. B ( C i^i D ) = ( U_ x e. A C i^i U_ y e. B D )

Syntax hints:   = wceq 1395   e. wcel 2200   i^i cin 3196   U_ciun 3964

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-in 3203  df-ss 3210  df-iun 3966

This theorem is referenced by: (None)