![]() |
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 4344 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 4339 | . . 3 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
3 | 2 | notbii 320 | . 2 ⊢ (¬ 𝐴 = ∅ ↔ ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
4 | df-ex 1783 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 ↔ ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴) | |
5 | 3, 4 | bitr4i 278 | 1 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 ∀wal 1540 = wceq 1542 ∃wex 1782 ∈ wcel 2107 Ⅎwnfc 2884 ∅c0 4321 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-11 2155 ax-12 2172 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-dif 3950 df-nul 4322 |
This theorem is referenced by: n0f 4341 neq0OLD 4347 ralfal 43788 |
Copyright terms: Public domain | W3C validator |