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

Theorem 0nelxp 5681
Description: The empty set is not a member of a Cartesian product. (Contributed by NM, 2-May-1996.) (Revised by Mario Carneiro, 26-Apr-2015.) (Proof shortened by JJ, 13-Aug-2021.)
Assertion
Ref Expression
0nelxp ¬ ∅ ∈ (𝐴 × 𝐵)

Proof of Theorem 0nelxp
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3458 . . . . . . 7 𝑥 ∈ V
2 vex 3458 . . . . . . 7 𝑦 ∈ V
31, 2opnzi 5442 . . . . . 6 𝑥, 𝑦⟩ ≠ ∅
43nesymi 3014 . . . . 5 ¬ ∅ = ⟨𝑥, 𝑦
54intnanr 491 . . . 4 ¬ (∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵))
65nex 1820 . . 3 ¬ ∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵))
76nex 1820 . 2 ¬ ∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵))
8 elxp 5670 . 2 (∅ ∈ (𝐴 × 𝐵) ↔ ∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
97, 8mtbir 325 1 ¬ ∅ ∈ (𝐴 × 𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 399   = wceq 1560  wex 1799  wcel 2142  c0 4285  cop 4588   × cxp 5645
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-opab 5163  df-xp 5653
This theorem is referenced by:  0nelrel0  5707  nrelvOLD  5773  dmsn0  6196  onxpdisj  6473  mpoxopx0ov0  8196  dmtpos  8218  0nnq  10882  adderpq  10914  mulerpq  10915  lterpq  10928  0ncn  11091  structcnvcnv  17189  vtxval0  29240  iedgval0  29241  msrrcl  35893  oppfrcl2  49750  eloppf  49754
  Copyright terms: Public domain W3C validator