| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eq0f | Structured version Visualization version GIF version | ||
| Description: A class is equal to the empty set if and only if it has no elements. Theorem 2 of [Suppes] p. 22. (Contributed by BJ, 15-Jul-2021.) |
| Ref | Expression |
|---|---|
| eq0f.1 | ⊢ Ⅎ𝑥𝐴 |
| Ref | Expression |
|---|---|
| eq0f | ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eq0f.1 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfcv 2925 | . . 3 ⊢ Ⅎ𝑥∅ | |
| 3 | 1, 2 | cleqf 2953 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 4 | noel 4291 | . . . 4 ⊢ ¬ 𝑥 ∈ ∅ | |
| 5 | 4 | nbn 375 | . . 3 ⊢ (¬ 𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 6 | 5 | albii 1849 | . 2 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 7 | 3, 6 | bitr4i 281 | 1 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 209 ∀wal 1568 = wceq 1570 ∈ wcel 2143 Ⅎwnfc 2910 ∅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-8 2145 ax-9 2153 ax-11 2192 ax-12 2213 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-dif 3908 df-nul 4287 |
| This theorem is referenced by: neq0f 4302 ab0ALT 4337 bnj1476 35235 stoweidlem34 46768 |
| Copyright terms: Public domain | W3C validator |