| 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 6128 | . 2 ⊢ ((𝐴 × 𝐶) ∖ (𝐵 × 𝐶)) = (((𝐴 ∖ 𝐵) × 𝐶) ∪ (𝐴 × (𝐶 ∖ 𝐶))) | |
| 2 | difid 4316 | . . . . 5 ⊢ (𝐶 ∖ 𝐶) = ∅ | |
| 3 | 2 | xpeq2i 5658 | . . . 4 ⊢ (𝐴 × (𝐶 ∖ 𝐶)) = (𝐴 × ∅) |
| 4 | xp0 5731 | . . . 4 ⊢ (𝐴 × ∅) = ∅ | |
| 5 | 3, 4 | eqtri 2759 | . . 3 ⊢ (𝐴 × (𝐶 ∖ 𝐶)) = ∅ |
| 6 | 5 | uneq2i 4105 | . 2 ⊢ (((𝐴 ∖ 𝐵) × 𝐶) ∪ (𝐴 × (𝐶 ∖ 𝐶))) = (((𝐴 ∖ 𝐵) × 𝐶) ∪ ∅) |
| 7 | un0 4334 | . 2 ⊢ (((𝐴 ∖ 𝐵) × 𝐶) ∪ ∅) = ((𝐴 ∖ 𝐵) × 𝐶) | |
| 8 | 1, 6, 7 | 3eqtrri 2764 | 1 ⊢ ((𝐴 ∖ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∖ (𝐵 × 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∖ cdif 3886 ∪ cun 3887 ∅c0 4273 × cxp 5629 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-opab 5148 df-xp 5637 df-rel 5638 |
| This theorem is referenced by: resdifdi 6200 difxp1ss 32592 sxbrsigalem2 34430 |
| Copyright terms: Public domain | W3C validator |