![]() |
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 5714 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷)) = (∅ × (𝐶 ∩ 𝐷))) | |
2 | inxp 5856 | . 2 ⊢ ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷)) | |
3 | 0xp 5798 | . . 3 ⊢ (∅ × (𝐶 ∩ 𝐷)) = ∅ | |
4 | 3 | eqcomi 2749 | . 2 ⊢ ∅ = (∅ × (𝐶 ∩ 𝐷)) |
5 | 1, 2, 4 | 3eqtr4g 2805 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∩ cin 3975 ∅c0 4352 × cxp 5698 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-opab 5229 df-xp 5706 df-rel 5707 |
This theorem is referenced by: djudisj 6198 xp01disjl 8548 djuin 9987 nosupbnd2lem1 27778 noetasuplem3 27798 noetasuplem4 27799 xpdisjres 32620 esum2dlem 34056 disjxp1 44971 |
Copyright terms: Public domain | W3C validator |