|   | 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 5706 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ∩ 𝐷) × (𝐴 ∩ 𝐵)) = ((𝐶 ∩ 𝐷) × ∅)) | |
| 2 | inxp 5842 | . 2 ⊢ ((𝐶 × 𝐴) ∩ (𝐷 × 𝐵)) = ((𝐶 ∩ 𝐷) × (𝐴 ∩ 𝐵)) | |
| 3 | xp0 6178 | . . 3 ⊢ ((𝐶 ∩ 𝐷) × ∅) = ∅ | |
| 4 | 3 | eqcomi 2746 | . 2 ⊢ ∅ = ((𝐶 ∩ 𝐷) × ∅) | 
| 5 | 1, 2, 4 | 3eqtr4g 2802 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 × 𝐴) ∩ (𝐷 × 𝐵)) = ∅) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 = wceq 1540 ∩ cin 3950 ∅c0 4333 × cxp 5683 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pr 5432 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-br 5144 df-opab 5206 df-xp 5691 df-rel 5692 df-cnv 5693 | 
| This theorem is referenced by: xpsndisj 6183 | 
| Copyright terms: Public domain | W3C validator |