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

Theorem dfnul3 4298
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 1581 . . . 4 ¬ ⊥
2 pm3.24 407 . . . 4 ¬ (𝑥𝐴 ∧ ¬ 𝑥𝐴)
31, 22false 378 . . 3 (⊥ ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐴))
43abbii 2836 . 2 {𝑥 ∣ ⊥} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
5 dfnul4 4296 . 2 ∅ = {𝑥 ∣ ⊥}
6 df-rab 3424 . 2 {𝑥𝐴 ∣ ¬ 𝑥𝐴} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
74, 5, 63eqtr4i 2802 1 ∅ = {𝑥𝐴 ∣ ¬ 𝑥𝐴}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 400   = wceq 1567  wfal 1579  wcel 2149  {cab 2747  {crab 3423  c0 4294
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-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-rab 3424  df-dif 3916  df-nul 4295
This theorem is referenced by:  difid  4339  kmlem3  10136
  Copyright terms: Public domain W3C validator