Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > xpundir | Structured version Visualization version GIF version |
Description: Distributive law for Cartesian product over union. Similar to Theorem 103 of [Suppes] p. 52. (Contributed by NM, 30-Sep-2002.) |
Ref | Expression |
---|---|
xpundir | ⊢ ((𝐴 ∪ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-xp 5595 | . 2 ⊢ ((𝐴 ∪ 𝐵) × 𝐶) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} | |
2 | df-xp 5595 | . . . 4 ⊢ (𝐴 × 𝐶) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} | |
3 | df-xp 5595 | . . . 4 ⊢ (𝐵 × 𝐶) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)} | |
4 | 2, 3 | uneq12i 4095 | . . 3 ⊢ ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) = ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} ∪ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}) |
5 | elun 4083 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)) | |
6 | 5 | anbi1i 624 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐶)) |
7 | andir 1006 | . . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) | |
8 | 6, 7 | bitri 274 | . . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) |
9 | 8 | opabbii 5141 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} |
10 | unopab 5156 | . . . 4 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} ∪ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}) = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} | |
11 | 9, 10 | eqtr4i 2769 | . . 3 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} = ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} ∪ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}) |
12 | 4, 11 | eqtr4i 2769 | . 2 ⊢ ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} |
13 | 1, 12 | eqtr4i 2769 | 1 ⊢ ((𝐴 ∪ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 ∨ wo 844 = wceq 1539 ∈ wcel 2106 ∪ cun 3885 {copab 5136 × cxp 5587 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-v 3434 df-un 3892 df-opab 5137 df-xp 5595 |
This theorem is referenced by: xpun 5660 resundi 5905 xpprsng 7012 xpfi 9085 xp2dju 9932 alephadd 10333 hashxplem 14148 ustund 23373 cnmpopc 24091 poimirlem3 35780 poimirlem4 35781 poimirlem6 35783 poimirlem7 35784 poimirlem16 35793 poimirlem19 35796 fsuppssind 40282 pwssplit4 40914 |
Copyright terms: Public domain | W3C validator |