MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iuniin Unicode version

Theorem iuniin 4063
Description: Law combining indexed union with indexed intersection. Eq. 14 in [KuratowskiMostowski] p. 109. This theorem also appears as the last example at http://en.wikipedia.org/wiki/Union%5F%28set%5Ftheory%29. (Contributed by NM, 17-Aug-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
iuniin  |-  U_ x  e.  A  |^|_ y  e.  B  C  C_  |^|_ y  e.  B  U_ x  e.  A  C
Distinct variable groups:    x, y    y, A    x, B
Allowed substitution hints:    A( x)    B( y)    C( x, y)

Proof of Theorem iuniin
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 r19.12 2779 . . . 4  |-  ( E. x  e.  A  A. y  e.  B  z  e.  C  ->  A. y  e.  B  E. x  e.  A  z  e.  C )
2 vex 2919 . . . . . 6  |-  z  e. 
_V
3 eliin 4058 . . . . . 6  |-  ( z  e.  _V  ->  (
z  e.  |^|_ y  e.  B  C  <->  A. y  e.  B  z  e.  C ) )
42, 3ax-mp 8 . . . . 5  |-  ( z  e.  |^|_ y  e.  B  C 
<-> 
A. y  e.  B  z  e.  C )
54rexbii 2691 . . . 4  |-  ( E. x  e.  A  z  e.  |^|_ y  e.  B  C 
<->  E. x  e.  A  A. y  e.  B  z  e.  C )
6 eliun 4057 . . . . 5  |-  ( z  e.  U_ x  e.  A  C  <->  E. x  e.  A  z  e.  C )
76ralbii 2690 . . . 4  |-  ( A. y  e.  B  z  e.  U_ x  e.  A  C 
<-> 
A. y  e.  B  E. x  e.  A  z  e.  C )
81, 5, 73imtr4i 258 . . 3  |-  ( E. x  e.  A  z  e.  |^|_ y  e.  B  C  ->  A. y  e.  B  z  e.  U_ x  e.  A  C )
9 eliun 4057 . . 3  |-  ( z  e.  U_ x  e.  A  |^|_ y  e.  B  C 
<->  E. x  e.  A  z  e.  |^|_ y  e.  B  C )
10 eliin 4058 . . . 4  |-  ( z  e.  _V  ->  (
z  e.  |^|_ y  e.  B  U_ x  e.  A  C  <->  A. y  e.  B  z  e.  U_ x  e.  A  C
) )
112, 10ax-mp 8 . . 3  |-  ( z  e.  |^|_ y  e.  B  U_ x  e.  A  C  <->  A. y  e.  B  z  e.  U_ x  e.  A  C )
128, 9, 113imtr4i 258 . 2  |-  ( z  e.  U_ x  e.  A  |^|_ y  e.  B  C  ->  z  e.  |^|_ y  e.  B  U_ x  e.  A  C )
1312ssriv 3312 1  |-  U_ x  e.  A  |^|_ y  e.  B  C  C_  |^|_ y  e.  B  U_ x  e.  A  C
Colors of variables: wff set class
Syntax hints:    <-> wb 177    e. wcel 1721   A.wral 2666   E.wrex 2667   _Vcvv 2916    C_ wss 3280   U_ciun 4053   |^|_ciin 4054
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ral 2671  df-rex 2672  df-v 2918  df-in 3287  df-ss 3294  df-iun 4055  df-iin 4056
  Copyright terms: Public domain W3C validator