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

Theorem resiun2 5990
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 5662 . 2 (𝐶 ↾ ∪ 𝑥 ∈ 𝐴 𝐵) = (𝐶 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 × V))
2 df-res 5662 . . . . 5 (𝐶 ↾ 𝐵) = (𝐶 ∩ (𝐵 × V))
32a1i 11 . . . 4 (𝑥 ∈ 𝐴 → (𝐶 ↾ 𝐵) = (𝐶 ∩ (𝐵 × V)))
43iuneq2i 4972 . . 3 ∪ 𝑥 ∈ 𝐴 (𝐶 ↾ 𝐵) = ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ (𝐵 × V))
5 xpiundir 5722 . . . . 5 (∪ 𝑥 ∈ 𝐴 𝐵 × V) = ∪ 𝑥 ∈ 𝐴 (𝐵 × V)
65ineq2i 4114 . . . 4 (𝐶 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 × V)) = (𝐶 ∩ ∪ 𝑥 ∈ 𝐴 (𝐵 × V))
7 iunin2 5028 . . . 4 ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ (𝐵 × V)) = (𝐶 ∩ ∪ 𝑥 ∈ 𝐴 (𝐵 × V))
86, 7eqtr4i 2786 . . 3 (𝐶 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 × V)) = ∪ 𝑥 ∈ 𝐴 (𝐶 ∩ (𝐵 × V))
94, 8eqtr4i 2786 . 2 ∪ 𝑥 ∈ 𝐴 (𝐶 ↾ 𝐵) = (𝐶 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 × V))
101, 9eqtr4i 2786 1 (𝐶 ↾ ∪ 𝑥 ∈ 𝐴 𝐵) = ∪ 𝑥 ∈ 𝐴 (𝐶 ↾ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∩ cin 4089  ∪ ciun 4950   × cxp 5648   ↾ cres 5652
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-in 4091  df-un 4151  df-sn 4585  df-pr 4587  df-op 4835  df-iun 4952  df-opab 5167  df-xp 5656  df-res 5662
This theorem is used by:  fvn0ssdmfun  7075  dprd2da  20264
  Copyright terms: Public domain W3C validator