MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  resiun2 Structured version   Visualization version   GIF version

Theorem resiun2 6004
Description: Distribution of restriction over indexed union. (Contributed by Mario Carneiro, 29-May-2015.)
Assertion
Ref Expression
resiun2 (𝐶 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐶𝐵)
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem resiun2
StepHypRef Expression
1 df-res 5678 . 2 (𝐶 𝑥𝐴 𝐵) = (𝐶 ∩ ( 𝑥𝐴 𝐵 × V))
2 df-res 5678 . . . . 5 (𝐶𝐵) = (𝐶 ∩ (𝐵 × V))
32a1i 11 . . . 4 (𝑥𝐴 → (𝐶𝐵) = (𝐶 ∩ (𝐵 × V)))
43iuneq2i 4983 . . 3 𝑥𝐴 (𝐶𝐵) = 𝑥𝐴 (𝐶 ∩ (𝐵 × V))
5 xpiundir 5738 . . . . 5 ( 𝑥𝐴 𝐵 × V) = 𝑥𝐴 (𝐵 × V)
65ineq2i 4173 . . . 4 (𝐶 ∩ ( 𝑥𝐴 𝐵 × V)) = (𝐶 𝑥𝐴 (𝐵 × V))
7 iunin2 5040 . . . 4 𝑥𝐴 (𝐶 ∩ (𝐵 × V)) = (𝐶 𝑥𝐴 (𝐵 × V))
86, 7eqtr4i 2792 . . 3 (𝐶 ∩ ( 𝑥𝐴 𝐵 × V)) = 𝑥𝐴 (𝐶 ∩ (𝐵 × V))
94, 8eqtr4i 2792 . 2 𝑥𝐴 (𝐶𝐵) = (𝐶 ∩ ( 𝑥𝐴 𝐵 × V))
101, 9eqtr4i 2792 1 (𝐶 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐶𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2146  Vcvv 3458  cin 3907   ciun 4961   × cxp 5664  cres 5668
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-un 3913  df-in 3915  df-ss 3925  df-sn 4595  df-pr 4597  df-op 4601  df-iun 4963  df-opab 5179  df-xp 5672  df-res 5678
This theorem is used by:  fvn0ssdmfun  7076  dprd2da  20145
  Copyright terms: Public domain W3C validator