| 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 6163 | . 2 ⊢ ((𝐴 × 𝐶) ∖ (𝐵 × 𝐶)) = (((𝐴 ∖ 𝐵) × 𝐶) ∪ (𝐴 × (𝐶 ∖ 𝐶))) | |
| 2 | difid 4333 | . . . . 5 ⊢ (𝐶 ∖ 𝐶) = ∅ | |
| 3 | 2 | xpeq2i 5690 | . . . 4 ⊢ (𝐴 × (𝐶 ∖ 𝐶)) = (𝐴 × ∅) |
| 4 | xp0 5763 | . . . 4 ⊢ (𝐴 × ∅) = ∅ | |
| 5 | 3, 4 | eqtri 2786 | . . 3 ⊢ (𝐴 × (𝐶 ∖ 𝐶)) = ∅ |
| 6 | 5 | uneq2i 4120 | . 2 ⊢ (((𝐴 ∖ 𝐵) × 𝐶) ∪ (𝐴 × (𝐶 ∖ 𝐶))) = (((𝐴 ∖ 𝐵) × 𝐶) ∪ ∅) |
| 7 | un0 4352 | . 2 ⊢ (((𝐴 ∖ 𝐵) × 𝐶) ∪ ∅) = ((𝐴 ∖ 𝐵) × 𝐶) | |
| 8 | 1, 6, 7 | 3eqtrri 2791 | 1 ⊢ ((𝐴 ∖ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∖ (𝐵 × 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∖ cdif 3903 ∪ cun 3904 ∅c0 4287 × cxp 5661 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-opab 5175 df-xp 5669 df-rel 5670 |
| This theorem is referenced by: resdifdi 6239 difxp1ss 32849 sxbrsigalem2 34657 |
| Copyright terms: Public domain | W3C validator |