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

Theorem uniin1 5036
Description: Union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. (Contributed by Thierry Arnoux, 21-Jun-2020.)
Assertion
Ref Expression
uniin1 ∪ 𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = (∪ 𝐴 ∩ 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem uniin1
StepHypRef Expression
1 iunin1 5033 . 2 ∪ 𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝑥 ∩ 𝐵)
2 uniiun 5020 . . 3 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝑥
32ineq1i 4116 . 2 (∪ 𝐴 ∩ 𝐵) = (∪ 𝑥 ∈ 𝐴 𝑥 ∩ 𝐵)
41, 3eqtr4i 2789 1 ∪ 𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = (∪ 𝐴 ∩ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∩ cin 4092  ∪ cuni 4870  ∪ ciun 4954
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-uni 4871  df-iun 4956
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator