Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > xpun | Structured version Visualization version GIF version |
Description: The Cartesian product of two unions. (Contributed by NM, 12-Aug-2004.) |
Ref | Expression |
---|---|
xpun | ⊢ ((𝐴 ∪ 𝐵) × (𝐶 ∪ 𝐷)) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpundi 5613 | . 2 ⊢ ((𝐴 ∪ 𝐵) × (𝐶 ∪ 𝐷)) = (((𝐴 ∪ 𝐵) × 𝐶) ∪ ((𝐴 ∪ 𝐵) × 𝐷)) | |
2 | xpundir 5614 | . . 3 ⊢ ((𝐴 ∪ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) | |
3 | xpundir 5614 | . . 3 ⊢ ((𝐴 ∪ 𝐵) × 𝐷) = ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷)) | |
4 | 2, 3 | uneq12i 4134 | . 2 ⊢ (((𝐴 ∪ 𝐵) × 𝐶) ∪ ((𝐴 ∪ 𝐵) × 𝐷)) = (((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) ∪ ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷))) |
5 | un4 4142 | . 2 ⊢ (((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) ∪ ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷))) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷))) | |
6 | 1, 4, 5 | 3eqtri 2845 | 1 ⊢ ((𝐴 ∪ 𝐵) × (𝐶 ∪ 𝐷)) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1528 ∪ cun 3931 × cxp 5546 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-v 3494 df-un 3938 df-opab 5120 df-xp 5554 |
This theorem is referenced by: ex-xp 28142 |
Copyright terms: Public domain | W3C validator |