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

Theorem dfnul3 4356
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 1551 . . . 4 ¬ ⊥
2 pm3.24 402 . . . 4 ¬ (𝑥𝐴 ∧ ¬ 𝑥𝐴)
31, 22false 375 . . 3 (⊥ ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐴))
43abbii 2812 . 2 {𝑥 ∣ ⊥} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
5 dfnul4 4354 . 2 ∅ = {𝑥 ∣ ⊥}
6 df-rab 3444 . 2 {𝑥𝐴 ∣ ¬ 𝑥𝐴} = {𝑥 ∣ (𝑥𝐴 ∧ ¬ 𝑥𝐴)}
74, 5, 63eqtr4i 2778 1 ∅ = {𝑥𝐴 ∣ ¬ 𝑥𝐴}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1537  wfal 1549  wcel 2108  {cab 2717  {crab 3443  c0 4352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-9 2118  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-rab 3444  df-dif 3979  df-nul 4353
This theorem is referenced by:  difid  4398  kmlem3  10222
  Copyright terms: Public domain W3C validator