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

Theorem indir 4233
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 4231 . 2 (𝐶 ∩ (𝐴 ∪ 𝐵)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵))
2 incom 4108 . 2 ((𝐴 ∪ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∪ 𝐵))
3 incom 4108 . . 3 (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴)
4 incom 4108 . . 3 (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵)
53, 4uneq12i 4167 . 2 ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵))
61, 2, 53eqtr4i 2799 1 ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1572   ∩ cin 4091   ∪ cun 4151
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1575  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rab 3416  df-v 3455  df-in 4093  df-un 4153
This theorem is used by:  difundir  4238  undisj1  4417  disjpr2  4674  resundir  6000  predun  6356  djuassen  10295  fin23lem26  10441  fpwwe2lem12  10765  neitr  23555  fiuncmp  23779  connsuba  23795  trfil2  24263  tsmsres  24520  trust  24605  restmetu  24946  volun  25923  uniioombllem3  25963  itgsplitioo  26215  ppiprm  27537  chtprm  27539  chtdif  27544  ppidif  27549  cycpmco2f1  33785  carsgclctunlem1  35061  ballotlemfp1  35236  ballotlemgun  35269  mrsubvrs  36496  mthmpps  36556  fixun  36887  mbfposadd  38855  iunrelexp0  45023  31prm  49015
  Copyright terms: Public domain W3C validator