| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpdisj1 | Structured version Visualization version GIF version | ||
| Description: Cartesian products with disjoint sets are disjoint. (Contributed by NM, 13-Sep-2004.) |
| Ref | Expression |
|---|---|
| xpdisj1 | ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpeq1 5675 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷)) = (∅ × (𝐶 ∩ 𝐷))) | |
| 2 | inxp 5818 | . 2 ⊢ ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷)) | |
| 3 | 0xp 5760 | . . 3 ⊢ (∅ × (𝐶 ∩ 𝐷)) = ∅ | |
| 4 | 3 | eqcomi 2772 | . 2 ⊢ ∅ = (∅ × (𝐶 ∩ 𝐷)) |
| 5 | 1, 2, 4 | 3eqtr4g 2823 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∩ cin 3904 ∅c0 4286 × cxp 5659 |
| 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 5257 ax-pr 5404 |
| 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 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-opab 5174 df-xp 5667 df-rel 5668 |
| This theorem is referenced by: djudisj 6164 xp01disjl 8473 djuin 9900 nosupbnd2lem1 27879 noetasuplem3 27899 noetasuplem4 27900 xpdisjres 32943 esum2dlem 34482 disjxp1 45789 |
| Copyright terms: Public domain | W3C validator |