Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > undir | GIF version |
Description: Distributive law for union over intersection. Theorem 29 of [Suppes] p. 27. (Contributed by NM, 30-Sep-2002.) |
Ref | Expression |
---|---|
undir | ⊢ ((𝐴 ∩ 𝐵) ∪ 𝐶) = ((𝐴 ∪ 𝐶) ∩ (𝐵 ∪ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | undi 3185 | . 2 ⊢ (𝐶 ∪ (𝐴 ∩ 𝐵)) = ((𝐶 ∪ 𝐴) ∩ (𝐶 ∪ 𝐵)) | |
2 | uncom 3087 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∪ 𝐶) = (𝐶 ∪ (𝐴 ∩ 𝐵)) | |
3 | uncom 3087 | . . 3 ⊢ (𝐴 ∪ 𝐶) = (𝐶 ∪ 𝐴) | |
4 | uncom 3087 | . . 3 ⊢ (𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵) | |
5 | 3, 4 | ineq12i 3136 | . 2 ⊢ ((𝐴 ∪ 𝐶) ∩ (𝐵 ∪ 𝐶)) = ((𝐶 ∪ 𝐴) ∩ (𝐶 ∪ 𝐵)) |
6 | 1, 2, 5 | 3eqtr4i 2070 | 1 ⊢ ((𝐴 ∩ 𝐵) ∪ 𝐶) = ((𝐴 ∪ 𝐶) ∩ (𝐵 ∪ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: = wceq 1243 ∪ cun 2915 ∩ cin 2916 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-v 2559 df-un 2922 df-in 2924 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |