![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfnul4 | Structured version Visualization version GIF version |
Description: Alternate definition of the empty class/set. (Contributed by BJ, 30-Nov-2019.) Avoid ax-8 2110, df-clel 2819. (Revised by GG, 3-Sep-2024.) Prove directly from definition to allow shortening dfnul2 4355. (Revised by BJ, 23-Sep-2024.) |
Ref | Expression |
---|---|
dfnul4 | ⊢ ∅ = {𝑥 ∣ ⊥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-nul 4353 | . 2 ⊢ ∅ = (V ∖ V) | |
2 | df-dif 3979 | . 2 ⊢ (V ∖ V) = {𝑥 ∣ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ V)} | |
3 | pm3.24 402 | . . . 4 ⊢ ¬ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ V) | |
4 | 3 | bifal 1553 | . . 3 ⊢ ((𝑥 ∈ V ∧ ¬ 𝑥 ∈ V) ↔ ⊥) |
5 | 4 | abbii 2812 | . 2 ⊢ {𝑥 ∣ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ V)} = {𝑥 ∣ ⊥} |
6 | 1, 2, 5 | 3eqtri 2772 | 1 ⊢ ∅ = {𝑥 ∣ ⊥} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1537 ⊥wfal 1549 ∈ wcel 2108 {cab 2717 Vcvv 3488 ∖ cdif 3973 ∅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: dfnul2 4355 dfnul3 4356 noel 4360 vn0 4368 eq0 4373 ab0w 4401 ab0 4402 ab0OLD 4403 abf 4429 eq0rdv 4430 rzal 4532 ralf0 4537 |
Copyright terms: Public domain | W3C validator |