![]() |
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 5683 | . 2 ⊢ ((𝐴 ∪ 𝐵) × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} | |
2 | df-xp 5683 | . . . 4 ⊢ (𝐴 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} | |
3 | df-xp 5683 | . . . 4 ⊢ (𝐵 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)} | |
4 | 2, 3 | uneq12i 4162 | . . 3 ⊢ ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}) |
5 | elun 4149 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)) | |
6 | 5 | anbi1i 625 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐶)) |
7 | andir 1008 | . . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) | |
8 | 6, 7 | bitri 275 | . . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) |
9 | 8 | opabbii 5216 | . . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} |
10 | unopab 5231 | . . . 4 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} | |
11 | 9, 10 | eqtr4i 2764 | . . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}) |
12 | 4, 11 | eqtr4i 2764 | . 2 ⊢ ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝑦 ∈ 𝐶)} |
13 | 1, 12 | eqtr4i 2764 | 1 ⊢ ((𝐴 ∪ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 ∪ cun 3947 {copab 5211 × cxp 5675 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-v 3477 df-un 3954 df-opab 5212 df-xp 5683 |
This theorem is referenced by: xpun 5750 resundi 5996 xpprsng 7138 naddasslem1 8693 xpfiOLD 9318 xp2dju 10171 alephadd 10572 hashxplem 14393 ustund 23726 cnmpopc 24444 poimirlem3 36491 poimirlem4 36492 poimirlem6 36494 poimirlem7 36495 poimirlem16 36504 poimirlem19 36507 fsuppssind 41165 pwssplit4 41831 |
Copyright terms: Public domain | W3C validator |