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

Theorem dfnul3 4265
Description: Alternate definition of the empty set. (Contributed by NM, 25-Mar-2004.) (Proof shortened by BJ, 23-Sep-2024.)
Assertion
Ref Expression
dfnul3 ∅ = {𝑥𝐴 ∣ ¬ 𝑥𝐴}

Proof of Theorem dfnul3
StepHypRef Expression
1 fal 1561 . . . 4 ¬ ⊥
2 pm3.24 403 . . . 4 ¬ (𝑥𝐴 ∧ ¬ 𝑥𝐴)
31, 22false 376 . . 3 (⊥ ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐴))
43abbii 2806 . 2 {𝑥 ∣ ⊥} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
5 dfnul4 4263 . 2 ∅ = {𝑥 ∣ ⊥}
6 df-rab 3392 . 2 {𝑥𝐴 ∣ ¬ 𝑥𝐴} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
74, 5, 63eqtr4i 2772 1 ∅ = {𝑥𝐴 ∣ ¬ 𝑥𝐴}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 396   = wceq 1547  wfal 1559  wcel 2119  {cab 2717  {crab 3391  c0 4261
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-9 2129  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-rab 3392  df-dif 3886  df-nul 4262
This theorem is referenced by:  difid  4304  kmlem3  10066
  Copyright terms: Public domain W3C validator