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

Theorem resiun2 5033
Description: Distribution of restriction over indexed union. (Contributed by Mario Carneiro, 29-May-2015.)
Assertion
Ref Expression
resiun2  |-  ( C  |`  U_ x  e.  A  B )  =  U_ x  e.  A  ( C  |`  B )
Distinct variable group:    x, C
Allowed substitution hints:    A( x)    B( x)

Proof of Theorem resiun2
StepHypRef Expression
1 df-res 4737 . 2  |-  ( C  |`  U_ x  e.  A  B )  =  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )
2 df-res 4737 . . . . 5  |-  ( C  |`  B )  =  ( C  i^i  ( B  X.  _V ) )
32a1i 9 . . . 4  |-  ( x  e.  A  ->  ( C  |`  B )  =  ( C  i^i  ( B  X.  _V ) ) )
43iuneq2i 3988 . . 3  |-  U_ x  e.  A  ( C  |`  B )  =  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )
5 xpiundir 4785 . . . . 5  |-  ( U_ x  e.  A  B  X.  _V )  =  U_ x  e.  A  ( B  X.  _V )
65ineq2i 3405 . . . 4  |-  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )  =  ( C  i^i  U_ x  e.  A  ( B  X.  _V ) )
7 iunin2 4034 . . . 4  |-  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )  =  ( C  i^i  U_ x  e.  A  ( B  X.  _V ) )
86, 7eqtr4i 2255 . . 3  |-  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )  =  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )
94, 8eqtr4i 2255 . 2  |-  U_ x  e.  A  ( C  |`  B )  =  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )
101, 9eqtr4i 2255 1  |-  ( C  |`  U_ x  e.  A  B )  =  U_ x  e.  A  ( C  |`  B )
Colors of variables: wff set class
Syntax hints:    = wceq 1397    e. wcel 2202   _Vcvv 2802    i^i cin 3199   U_ciun 3970    X. cxp 4723    |` cres 4727
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-iun 3972  df-opab 4151  df-xp 4731  df-res 4737
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator