Theorem xpdisj1 6153

Description: Cartesian products with disjoint sets are disjoint. (Contributed by NM, 13-Sep-2004.)

Assertion

Ref	Expression
xpdisj1	⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ∅)

Proof of Theorem xpdisj1

Step	Hyp	Ref	Expression
1		xpeq1 5664	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷)) = (∅ × (𝐶 ∩ 𝐷)))
2		inxp 5809	. 2 ⊢ ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐷))
3		0xp 5750	. . 3 ⊢ (∅ × (𝐶 ∩ 𝐷)) = ∅
4	3	eqcomi 2769	. 2 ⊢ ∅ = (∅ × (𝐶 ∩ 𝐷))
5	1, 2, 4	3eqtr4g 2820	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × 𝐶) ∩ (𝐵 × 𝐷)) = ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∩ cin 4088  ∅c0 4277   × cxp 5648

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-opab 5167  df-xp 5656  df-rel 5657

This theorem is used by:  djudisj  6159  xp01disjl  8505  djuin  10004  nosupbnd2lem1  28079  noetasuplem3  28099  noetasuplem4  28100  xpdisjres  33241  esum2dlem  34772  disjxp1  46193