| 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 4238 | . 2 ⊢ (𝐶 ∩ (𝐴 ∪ 𝐵)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵)) | |
| 2 | incom 4163 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = (𝐶 ∩ (𝐴 ∪ 𝐵)) | |
| 3 | incom 4163 | . . 3 ⊢ (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴) | |
| 4 | incom 4163 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵) | |
| 5 | 3, 4 | uneq12i 4121 | . 2 ⊢ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵)) |
| 6 | 1, 2, 5 | 3eqtr4i 2797 | 1 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1562 ∪ cun 3904 ∩ cin 3905 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-rab 3417 df-v 3458 df-un 3911 df-in 3913 |
| This theorem is referenced by: difundir 4245 undisj1 4418 disjpr2 4674 resundir 5982 predun 6317 djuassen 10137 fin23lem26 10284 fpwwe2lem12 10602 neitr 23242 fiuncmp 23466 connsuba 23482 trfil2 23949 tsmsres 24206 trust 24291 restmetu 24632 volun 25609 uniioombllem3 25649 itgsplitioo 25902 ppiprm 27217 chtprm 27219 chtdif 27224 ppidif 27229 cycpmco2f1 33306 carsgclctunlem1 34616 ballotlemfp1 34791 ballotlemgun 34824 mrsubvrs 35877 mthmpps 35937 fixun 36262 mbfposadd 38171 iunrelexp0 44283 31prm 48211 |
| Copyright terms: Public domain | W3C validator |