| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difxp1 | 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 |
|---|---|
| difxp1 | ⊢ ((𝐴 ∖ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∖ (𝐵 × 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difxp 6166 | . 2 ⊢ ((𝐴 × 𝐶) ∖ (𝐵 × 𝐶)) = (((𝐴 ∖ 𝐵) × 𝐶) ∪ (𝐴 × (𝐶 ∖ 𝐶))) | |
| 2 | difid 4335 | . . . . 5 ⊢ (𝐶 ∖ 𝐶) = ∅ | |
| 3 | 2 | xpeq2i 5693 | . . . 4 ⊢ (𝐴 × (𝐶 ∖ 𝐶)) = (𝐴 × ∅) |
| 4 | xp0 5766 | . . . 4 ⊢ (𝐴 × ∅) = ∅ | |
| 5 | 3, 4 | eqtri 2789 | . . 3 ⊢ (𝐴 × (𝐶 ∖ 𝐶)) = ∅ |
| 6 | 5 | uneq2i 4122 | . 2 ⊢ (((𝐴 ∖ 𝐵) × 𝐶) ∪ (𝐴 × (𝐶 ∖ 𝐶))) = (((𝐴 ∖ 𝐵) × 𝐶) ∪ ∅) |
| 7 | un0 4354 | . 2 ⊢ (((𝐴 ∖ 𝐵) × 𝐶) ∪ ∅) = ((𝐴 ∖ 𝐵) × 𝐶) | |
| 8 | 1, 6, 7 | 3eqtrri 2794 | 1 ⊢ ((𝐴 ∖ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∖ (𝐵 × 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∖ cdif 3905 ∪ cun 3906 ∅c0 4289 × cxp 5664 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-opab 5179 df-xp 5672 df-rel 5673 |
| This theorem is used by: resdifdi 6242 difxp1ss 32905 sxbrsigalem2 34708 |
| Copyright terms: Public domain | W3C validator |