MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xpdisj1 Structured version   Visualization version   GIF version

Theorem xpdisj1 6170
Description: Cartesian products with disjoint sets are disjoint. (Contributed by NM, 13-Sep-2004.)
Assertion
Ref Expression
xpdisj1 ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ∅)

Proof of Theorem xpdisj1
StepHypRef Expression
1 xpeq1 5672 . 2 ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷)) = (∅ × (𝐶 ∩ 𝐷)))
2 inxp 5819 . 2 ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷))
3 0xp 5758 . . 3 (∅ × (𝐶 ∩ 𝐷)) = ∅
43eqcomi 2772 . 2 ∅ = (∅ × (𝐶 ∩ 𝐷))
51, 2, 43eqtr4g 2823 1 ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 4092  ∅c0 4281   × cxp 5656
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-opab 5174  df-xp 5664  df-rel 5665
This theorem is used by:  djudisj  6176  xp01disjl  8538  djuin  10036  nosupbnd2lem1  28129  noetasuplem3  28149  noetasuplem4  28150  xpdisjres  33290  esum2dlem  34835  disjxp1  46360
  Copyright terms: Public domain W3C validator