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

Theorem 0neqopab 6596
Description: The empty set is never an element in an ordered-pair class abstraction. (Contributed by Alexander van der Vekens, 5-Nov-2017.)
Assertion
Ref Expression
0neqopab ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Proof of Theorem 0neqopab
StepHypRef Expression
1 elopab 4908 . . 3 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2 nfopab1 4651 . . . . . 6 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
32nfel2 2767 . . . . 5 𝑥∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
43nfn 1768 . . . 4 𝑥 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
5 nfopab2 4652 . . . . . . 7 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
65nfel2 2767 . . . . . 6 𝑦∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
76nfn 1768 . . . . 5 𝑦 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
8 vex 3176 . . . . . . . 8 𝑥 ∈ V
9 vex 3176 . . . . . . . 8 𝑦 ∈ V
108, 9opnzi 4869 . . . . . . 7 𝑥, 𝑦⟩ ≠ ∅
11 nesym 2838 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ≠ ∅ ↔ ¬ ∅ = ⟨𝑥, 𝑦⟩)
12 pm2.21 119 . . . . . . . 8 (¬ ∅ = ⟨𝑥, 𝑦⟩ → (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
1311, 12sylbi 206 . . . . . . 7 (⟨𝑥, 𝑦⟩ ≠ ∅ → (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
1410, 13ax-mp 5 . . . . . 6 (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
1514adantr 480 . . . . 5 ((∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
167, 15exlimi 2073 . . . 4 (∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
174, 16exlimi 2073 . . 3 (∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
181, 17sylbi 206 . 2 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
19 id 22 . 2 (¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
2018, 19pm2.61i 175 1 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383   = wceq 1475  wex 1695  wcel 1977  wne 2780  c0 3874  cop 4131  {copab 4642
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-opab 4644
This theorem is referenced by:  brabv  6597  bj-0nelmpt  32250
  Copyright terms: Public domain W3C validator