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

Theorem indir 4234
Description: Distributive law for intersection over union. Theorem 28 of [Suppes] p. 27. (Contributed by NM, 30-Sep-2002.)
Assertion
Ref Expression
indir ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶))

Proof of Theorem indir
StepHypRef Expression
1 indi 4232 . 2 (𝐶 ∩ (𝐴 ∪ 𝐵)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵))
2 incom 4109 . 2 ((𝐴 ∪ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∪ 𝐵))
3 incom 4109 . . 3 (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴)
4 incom 4109 . . 3 (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵)
53, 4uneq12i 4168 . 2 ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵))
61, 2, 53eqtr4i 2796 1 ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∩ cin 4092   ∪ cun 4152
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-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-in 4094  df-un 4154
This theorem is used by:  difundir  4239  undisj1  4418  disjpr2  4674  resundir  5995  predun  6346  djuassen  10281  fin23lem26  10427  fpwwe2lem12  10751  neitr  23525  fiuncmp  23749  connsuba  23765  trfil2  24233  tsmsres  24490  trust  24575  restmetu  24916  volun  25893  uniioombllem3  25933  itgsplitioo  26185  ppiprm  27505  chtprm  27507  chtdif  27512  ppidif  27517  cycpmco2f1  33752  carsgclctunlem1  35016  ballotlemfp1  35191  ballotlemgun  35224  mrsubvrs  36453  mthmpps  36513  fixun  36848  mbfposadd  38776  iunrelexp0  44892  31prm  48885
  Copyright terms: Public domain W3C validator