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

Theorem dfnul3 4290
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 1584 . . . 4 ¬ ⊥
2 pm3.24 407 . . . 4 ¬ (𝑥𝐴 ∧ ¬ 𝑥𝐴)
31, 22false 378 . . 3 (⊥ ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐴))
43abbii 2830 . 2 {𝑥 ∣ ⊥} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
5 dfnul4 4288 . 2 ∅ = {𝑥 ∣ ⊥}
6 df-rab 3417 . 2 {𝑥𝐴 ∣ ¬ 𝑥𝐴} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
74, 5, 63eqtr4i 2796 1 ∅ = {𝑥𝐴 ∣ ¬ 𝑥𝐴}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 400   = wceq 1570  wfal 1582  wcel 2143  {cab 2741  {crab 3416  c0 4286
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-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-rab 3417  df-dif 3908  df-nul 4287
This theorem is referenced by:  difid  4332  kmlem3  10132
  Copyright terms: Public domain W3C validator