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

Theorem iuniin 3916
Description: Law combining indexed union with indexed intersection. Eq. 14 in 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 2657 . . . 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 2792 . . . . . 6  |-  z  e. 
_V
3 eliin 3911 . . . . . 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 2569 . . . 4  |-  ( E. x  e.  A  z  e.  |^|_ y  e.  B  C 
<->  E. x  e.  A  A. y  e.  B  z  e.  C )
6 eliun 3910 . . . . 5  |-  ( z  e.  U_ x  e.  A  C  <->  E. x  e.  A  z  e.  C )
76ralbii 2568 . . . 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 257 . . 3  |-  ( E. x  e.  A  z  e.  |^|_ y  e.  B  C  ->  A. y  e.  B  z  e.  U_ x  e.  A  C )
9 eliun 3910 . . 3  |-  ( z  e.  U_ x  e.  A  |^|_ y  e.  B  C 
<->  E. x  e.  A  z  e.  |^|_ y  e.  B  C )
10 eliin 3911 . . . 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 257 . 2  |-  ( z  e.  U_ x  e.  A  |^|_ y  e.  B  C  ->  z  e.  |^|_ y  e.  B  U_ x  e.  A  C )
1312ssriv 3185 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 176    e. wcel 1685   A.wral 2544   E.wrex 2545   _Vcvv 2789    C_ wss 3153   U_ciun 3906   |^|_ciin 3907
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ral 2549  df-rex 2550  df-v 2791  df-in 3160  df-ss 3167  df-iun 3908  df-iin 3909
  Copyright terms: Public domain W3C validator