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

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

Proof of Theorem resiun1
StepHypRef Expression
1 iunin2 4003 . 2  |-  U_ x  e.  A  ( ( C  X.  _V )  i^i 
B )  =  ( ( C  X.  _V )  i^i  U_ x  e.  A  B )
2 df-res 4738 . . . . 5  |-  ( B  |`  C )  =  ( B  i^i  ( C  X.  _V ) )
3 incom 3395 . . . . 5  |-  ( B  i^i  ( C  X.  _V ) )  =  ( ( C  X.  _V )  i^i  B )
42, 3eqtri 2336 . . . 4  |-  ( B  |`  C )  =  ( ( C  X.  _V )  i^i  B )
54a1i 10 . . 3  |-  ( x  e.  A  ->  ( B  |`  C )  =  ( ( C  X.  _V )  i^i  B ) )
65iuneq2i 3960 . 2  |-  U_ x  e.  A  ( B  |`  C )  =  U_ x  e.  A  (
( C  X.  _V )  i^i  B )
7 df-res 4738 . . 3  |-  ( U_ x  e.  A  B  |`  C )  =  (
U_ x  e.  A  B  i^i  ( C  X.  _V ) )
8 incom 3395 . . 3  |-  ( U_ x  e.  A  B  i^i  ( C  X.  _V ) )  =  ( ( C  X.  _V )  i^i  U_ x  e.  A  B )
97, 8eqtri 2336 . 2  |-  ( U_ x  e.  A  B  |`  C )  =  ( ( C  X.  _V )  i^i  U_ x  e.  A  B )
101, 6, 93eqtr4ri 2347 1  |-  ( U_ x  e.  A  B  |`  C )  =  U_ x  e.  A  ( B  |`  C )
Colors of variables: wff set class
Syntax hints:    = wceq 1633    e. wcel 1701   _Vcvv 2822    i^i cin 3185   U_ciun 3942    X. cxp 4724    |` cres 4728
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1533  df-nf 1536  df-sb 1640  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-ral 2582  df-rex 2583  df-v 2824  df-in 3193  df-ss 3200  df-iun 3944  df-res 4738
  Copyright terms: Public domain W3C validator