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

Theorem undi 4226
 Description: Distributive law for union over intersection. Exercise 11 of [TakeutiZaring] p. 17. (Contributed by NM, 30-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
undi (𝐴 ∪ (𝐵𝐶)) = ((𝐴𝐵) ∩ (𝐴𝐶))

Proof of Theorem undi
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elin 3926 . . . 4 (𝑥 ∈ (𝐵𝐶) ↔ (𝑥𝐵𝑥𝐶))
21orbi2i 910 . . 3 ((𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ (𝑥𝐴 ∨ (𝑥𝐵𝑥𝐶)))
3 ordi 1003 . . 3 ((𝑥𝐴 ∨ (𝑥𝐵𝑥𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (𝑥𝐴𝑥𝐶)))
4 elin 3926 . . . 4 (𝑥 ∈ ((𝐴𝐵) ∩ (𝐴𝐶)) ↔ (𝑥 ∈ (𝐴𝐵) ∧ 𝑥 ∈ (𝐴𝐶)))
5 elun 4101 . . . . 5 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
6 elun 4101 . . . . 5 (𝑥 ∈ (𝐴𝐶) ↔ (𝑥𝐴𝑥𝐶))
75, 6anbi12i 629 . . . 4 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥 ∈ (𝐴𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (𝑥𝐴𝑥𝐶)))
84, 7bitr2i 279 . . 3 (((𝑥𝐴𝑥𝐵) ∧ (𝑥𝐴𝑥𝐶)) ↔ 𝑥 ∈ ((𝐴𝐵) ∩ (𝐴𝐶)))
92, 3, 83bitri 300 . 2 ((𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ 𝑥 ∈ ((𝐴𝐵) ∩ (𝐴𝐶)))
109uneqri 4103 1 (𝐴 ∪ (𝐵𝐶)) = ((𝐴𝐵) ∩ (𝐴𝐶))
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2115   ∪ cun 3908   ∩ cin 3909 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-ext 2793 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-sb 2071  df-clab 2800  df-cleq 2814  df-clel 2892  df-v 3473  df-un 3915  df-in 3917 This theorem is referenced by:  undir  4228  dfif4  4455  dfif5  4456
 Copyright terms: Public domain W3C validator