| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difxp2 | Structured version Visualization version GIF version | ||
| Description: Difference law for Cartesian product. (Contributed by Scott Fenton, 18-Feb-2013.) (Revised by Mario Carneiro, 26-Jun-2014.) |
| Ref | Expression |
|---|---|
| difxp2 | ⊢ (𝐴 × (𝐵 ∖ 𝐶)) = ((𝐴 × 𝐵) ∖ (𝐴 × 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difxp 6108 | . 2 ⊢ ((𝐴 × 𝐵) ∖ (𝐴 × 𝐶)) = (((𝐴 ∖ 𝐴) × 𝐵) ∪ (𝐴 × (𝐵 ∖ 𝐶))) | |
| 2 | difid 4324 | . . . . 5 ⊢ (𝐴 ∖ 𝐴) = ∅ | |
| 3 | 2 | xpeq1i 5640 | . . . 4 ⊢ ((𝐴 ∖ 𝐴) × 𝐵) = (∅ × 𝐵) |
| 4 | 0xp 5713 | . . . 4 ⊢ (∅ × 𝐵) = ∅ | |
| 5 | 3, 4 | eqtri 2753 | . . 3 ⊢ ((𝐴 ∖ 𝐴) × 𝐵) = ∅ |
| 6 | 5 | uneq1i 4112 | . 2 ⊢ (((𝐴 ∖ 𝐴) × 𝐵) ∪ (𝐴 × (𝐵 ∖ 𝐶))) = (∅ ∪ (𝐴 × (𝐵 ∖ 𝐶))) |
| 7 | uncom 4106 | . . 3 ⊢ (∅ ∪ (𝐴 × (𝐵 ∖ 𝐶))) = ((𝐴 × (𝐵 ∖ 𝐶)) ∪ ∅) | |
| 8 | un0 4342 | . . 3 ⊢ ((𝐴 × (𝐵 ∖ 𝐶)) ∪ ∅) = (𝐴 × (𝐵 ∖ 𝐶)) | |
| 9 | 7, 8 | eqtri 2753 | . 2 ⊢ (∅ ∪ (𝐴 × (𝐵 ∖ 𝐶))) = (𝐴 × (𝐵 ∖ 𝐶)) |
| 10 | 1, 6, 9 | 3eqtrri 2758 | 1 ⊢ (𝐴 × (𝐵 ∖ 𝐶)) = ((𝐴 × 𝐵) ∖ (𝐴 × 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∖ cdif 3897 ∪ cun 3898 ∅c0 4281 × cxp 5612 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rex 3055 df-rab 3394 df-v 3436 df-dif 3903 df-un 3905 df-ss 3917 df-nul 4282 df-if 4474 df-sn 4575 df-pr 4577 df-op 4581 df-opab 5152 df-xp 5620 df-rel 5621 |
| This theorem is referenced by: difxp2ss 32493 imadifxp 32571 sxbrsigalem2 34289 |
| Copyright terms: Public domain | W3C validator |