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

Theorem unixp0 6239
Description: A Cartesian product is empty iff its union is empty. (Contributed by NM, 20-Sep-2006.)
Assertion
Ref Expression
unixp0 ((𝐴 × 𝐵) = ∅ ↔ (𝐴 × 𝐵) = ∅)

Proof of Theorem unixp0
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unieq 4872 . . 3 ((𝐴 × 𝐵) = ∅ → (𝐴 × 𝐵) = ∅)
2 uni0 4889 . . 3 ∅ = ∅
31, 2eqtrdi 2785 . 2 ((𝐴 × 𝐵) = ∅ → (𝐴 × 𝐵) = ∅)
4 n0 4303 . . . 4 ((𝐴 × 𝐵) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵))
5 elxp3 5688 . . . . . 6 (𝑧 ∈ (𝐴 × 𝐵) ↔ ∃𝑥𝑦(⟨𝑥, 𝑦⟩ = 𝑧 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
6 elssuni 4892 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ⊆ (𝐴 × 𝐵))
7 vex 3442 . . . . . . . . . 10 𝑥 ∈ V
8 vex 3442 . . . . . . . . . 10 𝑦 ∈ V
97, 8opnzi 5420 . . . . . . . . 9 𝑥, 𝑦⟩ ≠ ∅
10 ssn0 4354 . . . . . . . . 9 ((⟨𝑥, 𝑦⟩ ⊆ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ≠ ∅) → (𝐴 × 𝐵) ≠ ∅)
116, 9, 10sylancl 586 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → (𝐴 × 𝐵) ≠ ∅)
1211adantl 481 . . . . . . 7 ((⟨𝑥, 𝑦⟩ = 𝑧 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ≠ ∅)
1312exlimivv 1933 . . . . . 6 (∃𝑥𝑦(⟨𝑥, 𝑦⟩ = 𝑧 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ≠ ∅)
145, 13sylbi 217 . . . . 5 (𝑧 ∈ (𝐴 × 𝐵) → (𝐴 × 𝐵) ≠ ∅)
1514exlimiv 1931 . . . 4 (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) → (𝐴 × 𝐵) ≠ ∅)
164, 15sylbi 217 . . 3 ((𝐴 × 𝐵) ≠ ∅ → (𝐴 × 𝐵) ≠ ∅)
1716necon4i 2965 . 2 ( (𝐴 × 𝐵) = ∅ → (𝐴 × 𝐵) = ∅)
183, 17impbii 209 1 ((𝐴 × 𝐵) = ∅ ↔ (𝐴 × 𝐵) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wex 1780  wcel 2113  wne 2930  wss 3899  c0 4283  cop 4584   cuni 4861   × cxp 5620
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-opab 5159  df-xp 5628
This theorem is referenced by:  rankxpsuc  9792
  Copyright terms: Public domain W3C validator