![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfnul2 | Structured version Visualization version GIF version |
Description: Alternate definition of the empty set. Definition 5.14 of [TakeutiZaring] p. 20. (Contributed by NM, 26-Dec-1996.) Remove dependency on ax-10 2141, ax-11 2158, and ax-12 2178. (Revised by Steven Nguyen, 3-May-2023.) (Proof shortened by BJ, 23-Sep-2024.) |
Ref | Expression |
---|---|
dfnul2 | ⊢ ∅ = {𝑥 ∣ ¬ 𝑥 = 𝑥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfnul4 4354 | . 2 ⊢ ∅ = {𝑥 ∣ ⊥} | |
2 | equid 2011 | . . . . 5 ⊢ 𝑥 = 𝑥 | |
3 | 2 | notnoti 143 | . . . 4 ⊢ ¬ ¬ 𝑥 = 𝑥 |
4 | 3 | bifal 1553 | . . 3 ⊢ (¬ 𝑥 = 𝑥 ↔ ⊥) |
5 | 4 | abbii 2812 | . 2 ⊢ {𝑥 ∣ ¬ 𝑥 = 𝑥} = {𝑥 ∣ ⊥} |
6 | 1, 5 | eqtr4i 2771 | 1 ⊢ ∅ = {𝑥 ∣ ¬ 𝑥 = 𝑥} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1537 ⊥wfal 1549 {cab 2717 ∅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-dif 3979 df-nul 4353 |
This theorem is referenced by: dfnul3OLD 4358 dfnul4OLD 4359 ab0orv 4406 iotanul 6551 avril1 30495 |
Copyright terms: Public domain | W3C validator |