Theorem indir 4235

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

Step	Hyp	Ref	Expression
1		indi 4233	. 2 ⊢ (𝐶 ∩ (𝐴 ∪ 𝐵)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵))
2		incom 4158	. 2 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∪ 𝐵))
3		incom 4158	. . 3 ⊢ (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴)
4		incom 4158	. . 3 ⊢ (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵)
5	3, 4	uneq12i 4116	. 2 ⊢ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵))
6	1, 2, 5	3eqtr4i 2795	1 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶))

This proof depends on syntax axioms:   = wceq 1570   ∪ cun 3900   ∩ cin 3901

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-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-un 3907  df-in 3909

This theorem is used by:  difundir  4240  undisj1  4418  disjpr2  4677  resundir  5991  predun  6330  djuassen  10184  fin23lem26  10330  fpwwe2lem12  10654  neitr  23406  fiuncmp  23630  connsuba  23646  trfil2  24114  tsmsres  24371  trust  24456  restmetu  24797  volun  25774  uniioombllem3  25814  itgsplitioo  26067  ppiprm  27385  chtprm  27387  chtdif  27392  ppidif  27397  cycpmco2f1  33551  carsgclctunlem1  34815  ballotlemfp1  34990  ballotlemgun  35023  mrsubvrs  36088  mthmpps  36148  fixun  36473  mbfposadd  38403  iunrelexp0  44529  31prm  48487