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

Theorem resiun1 5996
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 5034 . 2 𝑥𝐴 (𝐵 ∩ (𝐶 × V)) = ( 𝑥𝐴 𝐵 ∩ (𝐶 × V))
2 df-res 5671 . . . 4 (𝐵𝐶) = (𝐵 ∩ (𝐶 × V))
32a1i 11 . . 3 (𝑥𝐴 → (𝐵𝐶) = (𝐵 ∩ (𝐶 × V)))
43iuneq2i 4976 . 2 𝑥𝐴 (𝐵𝐶) = 𝑥𝐴 (𝐵 ∩ (𝐶 × V))
5 df-res 5671 . 2 ( 𝑥𝐴 𝐵𝐶) = ( 𝑥𝐴 𝐵 ∩ (𝐶 × V))
61, 4, 53eqtr4ri 2796 1 ( 𝑥𝐴 𝐵𝐶) = 𝑥𝐴 (𝐵𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2145  Vcvv 3453  cin 3901   ciun 4954   × cxp 5657  cres 5661
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 2147  ax-9 2155  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-in 3909  df-ss 3919  df-iun 4956  df-res 5671
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator