| 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 4120 | . 2 ⊢ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ((𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵)) |
| 6 | 1, 2, 5 | 3eqtr4i 2770 | 1 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∪ cun 3901 ∩ cin 3902 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-un 3908 df-in 3910 |
| This theorem is referenced by: difundir 4245 undisj1 4416 disjpr2 4672 resundir 5963 predun 6296 djuassen 10103 fin23lem26 10249 fpwwe2lem12 10567 neitr 23141 fiuncmp 23365 connsuba 23381 trfil2 23848 tsmsres 24105 trust 24190 restmetu 24531 volun 25519 uniioombllem3 25559 itgsplitioo 25812 ppiprm 27134 chtprm 27136 chtdif 27141 ppidif 27146 cycpmco2f1 33224 carsgclctunlem1 34501 ballotlemfp1 34676 ballotlemgun 34709 mrsubvrs 35744 mthmpps 35804 fixun 36129 mbfposadd 37947 iunrelexp0 44087 31prm 47986 |
| Copyright terms: Public domain | W3C validator |