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

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

Proof of Theorem opab0
StepHypRef Expression
1 opabn0 5540 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ≠ ∅ ↔ ∃𝑥𝑦𝜑)
2 df-ne 2959 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ≠ ∅ ↔ ¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = ∅)
3 2exnaln 1859 . . 3 (∃𝑥𝑦𝜑 ↔ ¬ ∀𝑥𝑦 ¬ 𝜑)
41, 2, 33bitr3i 304 . 2 (¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = ∅ ↔ ¬ ∀𝑥𝑦 ¬ 𝜑)
54con4bii 324 1 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} = ∅ ↔ ∀𝑥𝑦 ¬ 𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 209  wal 1568   = wceq 1570  wex 1809  wne 2958  c0 4287  {copab 5174
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735  ax-sep 5258  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-sn 4591  df-pr 4593  df-op 4597  df-opab 5175
This theorem is referenced by:  iresn0n0  6058  epinid0  9568  cnvepnep  9578  opabf  39006  tfsconcatb0  44054  sprsymrelfvlem  48222
  Copyright terms: Public domain W3C validator