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

Theorem opab0 5528
Description: Empty ordered pair class abstraction. (Contributed by AV, 29-Oct-2021.)
Assertion
Ref Expression
opab0 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} = ∅ ↔ ∀𝑥∀𝑦 ¬ 𝜑)

Proof of Theorem opab0
StepHypRef Expression
1 opabn0 5527 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ≠ ∅ ↔ ∃𝑥∃𝑦𝜑)
2 df-ne 2956 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ≠ ∅ ↔ ¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = ∅)
3 2exnaln 1861 . . 3 (∃𝑥∃𝑦𝜑 ↔ ¬ ∀𝑥∀𝑦 ¬ 𝜑)
41, 2, 33bitr3i 304 . 2 (¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = ∅ ↔ ¬ ∀𝑥∀𝑦 ¬ 𝜑)
54con4bii 324 1 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} = ∅ ↔ ∀𝑥∀𝑦 ¬ 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1567   = wceq 1569  ∃wex 1811   ≠ wne 2955  ∅c0 4278  {copab 5166
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-11 2193  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-ne 2956  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-sn 4585  df-pr 4587  df-op 4835  df-opab 5167
This theorem is used by:  iresn0n0  6045  epinid0  9602  cnvepnep  9612  opabf  39401  tfsconcatb0  44439  sprsymrelfvlem  48665
  Copyright terms: Public domain W3C validator