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

Theorem resiun1 5911
Description: Distribution of restriction over indexed union. (Contributed by Mario Carneiro, 29-May-2015.) (Proof shortened by JJ, 25-Aug-2021.)
Assertion
Ref Expression
resiun1 ( 𝑥𝐴 𝐵𝐶) = 𝑥𝐴 (𝐵𝐶)
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem resiun1
StepHypRef Expression
1 iunin1 5001 . 2 𝑥𝐴 (𝐵 ∩ (𝐶 × V)) = ( 𝑥𝐴 𝐵 ∩ (𝐶 × V))
2 df-res 5601 . . . 4 (𝐵𝐶) = (𝐵 ∩ (𝐶 × V))
32a1i 11 . . 3 (𝑥𝐴 → (𝐵𝐶) = (𝐵 ∩ (𝐶 × V)))
43iuneq2i 4945 . 2 𝑥𝐴 (𝐵𝐶) = 𝑥𝐴 (𝐵 ∩ (𝐶 × V))
5 df-res 5601 . 2 ( 𝑥𝐴 𝐵𝐶) = ( 𝑥𝐴 𝐵 ∩ (𝐶 × V))
61, 4, 53eqtr4ri 2777 1 ( 𝑥𝐴 𝐵𝐶) = 𝑥𝐴 (𝐵𝐶)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1539  wcel 2106  Vcvv 3432  cin 3886   ciun 4924   × cxp 5587  cres 5591
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-in 3894  df-ss 3904  df-iun 4926  df-res 5601
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator