| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indir | Structured version Visualization version GIF version | ||
| Description: Distributive law for intersection over union. Theorem 28 of [Suppes] p. 27. (Contributed by NM, 30-Sep-2002.) |
| Ref | Expression |
|---|---|
| indir | ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indi 4234 | . 2 ⊢ (𝐶 ∩ (𝐴 ∪ 𝐵)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵)) | |
| 2 | incom 4159 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∪ 𝐵)) | |
| 3 | incom 4159 | . . 3 ⊢ (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴) | |
| 4 | incom 4159 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵) | |
| 5 | 3, 4 | uneq12i 4116 | . 2 ⊢ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵)) |
| 6 | 1, 2, 5 | 3eqtr4i 2767 | 1 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∪ cun 3897 ∩ cin 3898 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-rab 3398 df-v 3440 df-un 3904 df-in 3906 |
| This theorem is referenced by: difundir 4241 undisj1 4412 disjpr2 4668 resundir 5951 predun 6284 djuassen 10087 fin23lem26 10233 fpwwe2lem12 10551 neitr 23122 fiuncmp 23346 connsuba 23362 trfil2 23829 tsmsres 24086 trust 24171 restmetu 24512 volun 25500 uniioombllem3 25540 itgsplitioo 25793 ppiprm 27115 chtprm 27117 chtdif 27122 ppidif 27127 cycpmco2f1 33155 carsgclctunlem1 34423 ballotlemfp1 34598 ballotlemgun 34631 mrsubvrs 35665 mthmpps 35725 fixun 36050 mbfposadd 37807 iunrelexp0 43885 31prm 47785 |
| Copyright terms: Public domain | W3C validator |