| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpdisj2 | Structured version Visualization version GIF version | ||
| Description: Cartesian products with disjoint sets are disjoint. (Contributed by NM, 13-Sep-2004.) |
| Ref | Expression |
|---|---|
| xpdisj2 | ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 × 𝐴) ∩ (𝐷 × 𝐵)) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpeq2 5676 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ∩ 𝐷) × (𝐴 ∩ 𝐵)) = ((𝐶 ∩ 𝐷) × ∅)) | |
| 2 | inxp 5812 | . 2 ⊢ ((𝐶 × 𝐴) ∩ (𝐷 × 𝐵)) = ((𝐶 ∩ 𝐷) × (𝐴 ∩ 𝐵)) | |
| 3 | xp0 5755 | . . 3 ⊢ ((𝐶 ∩ 𝐷) × ∅) = ∅ | |
| 4 | 3 | eqcomi 2769 | . 2 ⊢ ∅ = ((𝐶 ∩ 𝐷) × ∅) |
| 5 | 1, 2, 4 | 3eqtr4g 2820 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 × 𝐴) ∩ (𝐷 × 𝐵)) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∩ cin 3898 ∅c0 4279 × cxp 5653 |
| 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 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| 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 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-opab 5168 df-xp 5661 df-rel 5662 |
| This theorem is used by: xpsndisj 6155 |
| Copyright terms: Public domain | W3C validator |