| 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 2898 | . . 3 ⊢ Ⅎ𝑥∅ | |
| 3 | 1, 2 | cleqf 2927 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 4 | noel 4278 | . . . 4 ⊢ ¬ 𝑥 ∈ ∅ | |
| 5 | 4 | nbn 372 | . . 3 ⊢ (¬ 𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 6 | 5 | albii 1821 | . 2 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 7 | 3, 6 | bitr4i 278 | 1 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 ∀wal 1540 = wceq 1542 ∈ wcel 2114 Ⅎwnfc 2883 ∅c0 4273 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-11 2163 ax-12 2185 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-dif 3892 df-nul 4274 |
| This theorem is referenced by: neq0f 4288 ab0ALT 4321 bnj1476 34989 stoweidlem34 46462 |
| Copyright terms: Public domain | W3C validator |