| 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 2931 | . . 3 ⊢ Ⅎ𝑥∅ | |
| 3 | 1, 2 | cleqf 2959 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 4 | noel 4299 | . . . 4 ⊢ ¬ 𝑥 ∈ ∅ | |
| 5 | 4 | nbn 375 | . . 3 ⊢ (¬ 𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 6 | 5 | albii 1846 | . 2 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 7 | 3, 6 | bitr4i 281 | 1 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 209 ∀wal 1565 = wceq 1567 ∈ wcel 2149 Ⅎwnfc 2916 ∅c0 4294 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-11 2198 ax-12 2219 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-dif 3916 df-nul 4295 |
| This theorem is referenced by: neq0f 4310 ab0ALT 4344 bnj1476 35179 stoweidlem34 46639 |
| Copyright terms: Public domain | W3C validator |