| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > snnzb | Structured version Visualization version GIF version | ||
| Description: A singleton is nonempty iff its argument is a set. (Contributed by Scott Fenton, 8-May-2018.) |
| Ref | Expression |
|---|---|
| snnzb | ⊢ (𝐴 ∈ V ↔ {𝐴} ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snprc 4682 | . . 3 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅) | |
| 2 | df-ne 2958 | . . . 4 ⊢ ({𝐴} ≠ ∅ ↔ ¬ {𝐴} = ∅) | |
| 3 | 2 | con2bii 360 | . . 3 ⊢ ({𝐴} = ∅ ↔ ¬ {𝐴} ≠ ∅) |
| 4 | 1, 3 | bitri 278 | . 2 ⊢ (¬ 𝐴 ∈ V ↔ ¬ {𝐴} ≠ ∅) |
| 5 | 4 | con4bii 324 | 1 ⊢ (𝐴 ∈ V ↔ {𝐴} ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 Vcvv 3454 ∅c0 4285 {csn 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-v 3456 df-dif 3907 df-nul 4286 df-sn 4589 |
| This theorem is used by: lpvtx 29429 loop1cycl 35637 elima4 36276 |
| Copyright terms: Public domain | W3C validator |