| 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 6146 | . 2 ⊢ ((𝐴 × 𝐵) ∖ (𝐴 × 𝐶)) = (((𝐴 ∖ 𝐴) × 𝐵) ∪ (𝐴 × (𝐵 ∖ 𝐶))) | |
| 2 | difid 4328 | . . . . 5 ⊢ (𝐴 ∖ 𝐴) = ∅ | |
| 3 | 2 | xpeq1i 5671 | . . . 4 ⊢ ((𝐴 ∖ 𝐴) × 𝐵) = (∅ × 𝐵) |
| 4 | 0xp 5744 | . . . 4 ⊢ (∅ × 𝐵) = ∅ | |
| 5 | 3, 4 | eqtri 2784 | . . 3 ⊢ ((𝐴 ∖ 𝐴) × 𝐵) = ∅ |
| 6 | 5 | uneq1i 4117 | . 2 ⊢ (((𝐴 ∖ 𝐴) × 𝐵) ∪ (𝐴 × (𝐵 ∖ 𝐶))) = (∅ ∪ (𝐴 × (𝐵 ∖ 𝐶))) |
| 7 | uncom 4111 | . . 3 ⊢ (∅ ∪ (𝐴 × (𝐵 ∖ 𝐶))) = ((𝐴 × (𝐵 ∖ 𝐶)) ∪ ∅) | |
| 8 | un0 4347 | . . 3 ⊢ ((𝐴 × (𝐵 ∖ 𝐶)) ∪ ∅) = (𝐴 × (𝐵 ∖ 𝐶)) | |
| 9 | 7, 8 | eqtri 2784 | . 2 ⊢ (∅ ∪ (𝐴 × (𝐵 ∖ 𝐶))) = (𝐴 × (𝐵 ∖ 𝐶)) |
| 10 | 1, 6, 9 | 3eqtrri 2789 | 1 ⊢ (𝐴 × (𝐵 ∖ 𝐶)) = ((𝐴 × 𝐵) ∖ (𝐴 × 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∖ cdif 3901 ∪ cun 3902 ∅c0 4285 × cxp 5643 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5245 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-opab 5162 df-xp 5651 df-rel 5652 |
| This theorem is referenced by: difxp2ss 32671 imadifxp 32750 sxbrsigalem2 34544 |
| Copyright terms: Public domain | W3C validator |