| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > neq0f | Structured version Visualization version GIF version | ||
| Description: A class is not empty if and only if it has at least one element. Proposition 5.17(1) of [TakeutiZaring] p. 20. This version of neq0 4313 requires only that 𝑥 not be free in, rather than not occur in, 𝐴. (Contributed by BJ, 15-Jul-2021.) |
| Ref | Expression |
|---|---|
| eq0f.1 | ⊢ Ⅎ𝑥𝐴 |
| Ref | Expression |
|---|---|
| neq0f | ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eq0f.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 2 | 1 | eq0f 4308 | . . 3 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| 3 | 2 | notbii 323 | . 2 ⊢ (¬ 𝐴 = ∅ ↔ ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| 4 | df-ex 1807 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 ↔ ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴) | |
| 5 | 3, 4 | bitr4i 281 | 1 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 209 ∀wal 1565 = wceq 1567 ∃wex 1806 ∈ 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: n0f 4310 ralfal 45764 |
| Copyright terms: Public domain | W3C validator |