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

Theorem resiun2 4904
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 4616 . 2  |-  ( C  |`  U_ x  e.  A  B )  =  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )
2 df-res 4616 . . . . 5  |-  ( C  |`  B )  =  ( C  i^i  ( B  X.  _V ) )
32a1i 9 . . . 4  |-  ( x  e.  A  ->  ( C  |`  B )  =  ( C  i^i  ( B  X.  _V ) ) )
43iuneq2i 3884 . . 3  |-  U_ x  e.  A  ( C  |`  B )  =  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )
5 xpiundir 4663 . . . . 5  |-  ( U_ x  e.  A  B  X.  _V )  =  U_ x  e.  A  ( B  X.  _V )
65ineq2i 3320 . . . 4  |-  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )  =  ( C  i^i  U_ x  e.  A  ( B  X.  _V ) )
7 iunin2 3929 . . . 4  |-  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )  =  ( C  i^i  U_ x  e.  A  ( B  X.  _V ) )
86, 7eqtr4i 2189 . . 3  |-  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )  =  U_ x  e.  A  ( C  i^i  ( B  X.  _V ) )
94, 8eqtr4i 2189 . 2  |-  U_ x  e.  A  ( C  |`  B )  =  ( C  i^i  ( U_ x  e.  A  B  X.  _V ) )
101, 9eqtr4i 2189 1  |-  ( C  |`  U_ x  e.  A  B )  =  U_ x  e.  A  ( C  |`  B )
Colors of variables: wff set class
Syntax hints:    = wceq 1343    e. wcel 2136   _Vcvv 2726    i^i cin 3115   U_ciun 3866    X. cxp 4602    |` cres 4606
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-iun 3868  df-opab 4044  df-xp 4610  df-res 4616
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator