ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iunxpf Unicode version

Theorem iunxpf 4923
Description: Indexed union on a cross product is equals a double indexed union. The hypothesis specifies an implicit substitution. (Contributed by NM, 19-Dec-2008.)
Hypotheses
Ref Expression
iunxpf.1  |-  F/_ y C
iunxpf.2  |-  F/_ z C
iunxpf.3  |-  F/_ x D
iunxpf.4  |-  ( x  =  <. y ,  z
>.  ->  C  =  D )
Assertion
Ref Expression
iunxpf  |-  U_ x  e.  ( A  X.  B
) C  =  U_ y  e.  A  U_ z  e.  B  D
Distinct variable groups:    x, y, A   
x, z, B, y
Allowed substitution hints:    A( z)    C( x, y, z)    D( x, y, z)

Proof of Theorem iunxpf
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 iunxpf.1 . . . . 5  |-  F/_ y C
21nfcri 2386 . . . 4  |-  F/ y  w  e.  C
3 iunxpf.2 . . . . 5  |-  F/_ z C
43nfcri 2386 . . . 4  |-  F/ z  w  e.  C
5 iunxpf.3 . . . . 5  |-  F/_ x D
65nfcri 2386 . . . 4  |-  F/ x  w  e.  D
7 iunxpf.4 . . . . 5  |-  ( x  =  <. y ,  z
>.  ->  C  =  D )
87eleq2d 2308 . . . 4  |-  ( x  =  <. y ,  z
>.  ->  ( w  e.  C  <->  w  e.  D
) )
92, 4, 6, 8rexxpf 4922 . . 3  |-  ( E. x  e.  ( A  X.  B ) w  e.  C  <->  E. y  e.  A  E. z  e.  B  w  e.  D )
10 eliun 4011 . . 3  |-  ( w  e.  U_ x  e.  ( A  X.  B
) C  <->  E. x  e.  ( A  X.  B
) w  e.  C
)
11 eliun 4011 . . . 4  |-  ( w  e.  U_ y  e.  A  U_ z  e.  B  D  <->  E. y  e.  A  w  e.  U_ z  e.  B  D
)
12 eliun 4011 . . . . 5  |-  ( w  e.  U_ z  e.  B  D  <->  E. z  e.  B  w  e.  D )
1312rexbii 2557 . . . 4  |-  ( E. y  e.  A  w  e.  U_ z  e.  B  D  <->  E. y  e.  A  E. z  e.  B  w  e.  D )
1411, 13bitri 184 . . 3  |-  ( w  e.  U_ y  e.  A  U_ z  e.  B  D  <->  E. y  e.  A  E. z  e.  B  w  e.  D )
159, 10, 143bitr4i 212 . 2  |-  ( w  e.  U_ x  e.  ( A  X.  B
) C  <->  w  e.  U_ y  e.  A  U_ z  e.  B  D
)
1615eqriv 2235 1  |-  U_ x  e.  ( A  X.  B
) C  =  U_ y  e.  A  U_ z  e.  B  D
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209   F/_wnfc 2379   E.wrex 2529   <.cop 3708   U_ciun 4007    X. cxp 4767
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-iun 4009  df-opab 4188  df-xp 4775  df-rel 4776
This theorem is referenced by:  dfmpo  6449
  Copyright terms: Public domain W3C validator