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

Theorem resiun2 5031
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 4735 . 2  |-  ( C  |`  U_ x  e.  A  B )  =  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )
2 df-res 4735 . . . . 5  |-  ( C  |`  B )  =  ( C  i^i  ( B  X.  _V ) )
32a1i 9 . . . 4  |-  ( x  e.  A  ->  ( C  |`  B )  =  ( C  i^i  ( B  X.  _V ) ) )
43iuneq2i 3986 . . 3  |-  U_ x  e.  A  ( C  |`  B )  =  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )
5 xpiundir 4783 . . . . 5  |-  ( U_ x  e.  A  B  X.  _V )  =  U_ x  e.  A  ( B  X.  _V )
65ineq2i 3403 . . . 4  |-  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )  =  ( C  i^i  U_ x  e.  A  ( B  X.  _V ) )
7 iunin2 4032 . . . 4  |-  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )  =  ( C  i^i  U_ x  e.  A  ( B  X.  _V ) )
86, 7eqtr4i 2253 . . 3  |-  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )  =  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )
94, 8eqtr4i 2253 . 2  |-  U_ x  e.  A  ( C  |`  B )  =  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )
101, 9eqtr4i 2253 1  |-  ( C  |`  U_ x  e.  A  B )  =  U_ x  e.  A  ( C  |`  B )
Colors of variables: wff set class
Syntax hints:    = wceq 1395    e. wcel 2200   _Vcvv 2800    i^i cin 3197   U_ciun 3968    X. cxp 4721    |` cres 4725
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-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  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 2802  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-iun 3970  df-opab 4149  df-xp 4729  df-res 4735
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator