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

Theorem 0nelopab 5551
Description: The empty set is never an element in an ordered-pair class abstraction. (Contributed by Alexander van der Vekens, 5-Nov-2017.) Reduce axiom usage and shorten proof. (Revised by GG, 3-Oct-2024.)
Assertion
Ref Expression
0nelopab ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Proof of Theorem 0nelopab
StepHypRef Expression
1 vex 3467 . . . . . . 7 𝑥 ∈ V
2 vex 3467 . . . . . . 7 𝑦 ∈ V
31, 2opnzi 5457 . . . . . 6 𝑥, 𝑦⟩ ≠ ∅
43nesymi 3021 . . . . 5 ¬ ∅ = ⟨𝑥, 𝑦
54intnanr 492 . . . 4 ¬ (∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
65nex 1827 . . 3 ¬ ∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
76nex 1827 . 2 ¬ ∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
8 elopab 5512 . 2 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
97, 8mtbir 326 1 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 400   = wceq 1567  wex 1806  wcel 2149  c0 4294  cop 4600  {copab 5177
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-opab 5178
This theorem is referenced by:  brabv  5552  epelg  5563  satf0n0  35768  bj-0nelmpt  37645
  Copyright terms: Public domain W3C validator