| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > snn0d | Structured version Visualization version GIF version | ||
| Description: The singleton of a set is not empty. (Contributed by Glauco Siliprandi, 3-Mar-2021.) |
| Ref | Expression |
|---|---|
| snn0d.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| snn0d | ⊢ (𝜑 → {𝐴} ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snn0d.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 2 | snnzg 4737 | . 2 ⊢ (𝐴 ∈ 𝑉 → {𝐴} ≠ ∅) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝜑 → {𝐴} ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2147 ≠ wne 2959 ∅c0 4281 {csn 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-dif 4050 df-nul 4282 df-sn 4589 |
| This theorem is used by: 0nelop 5475 rnglidl0 21560 hausflim 24355 flimcf 24356 flimclslem 24358 cnpflf2 24374 cnpflf 24375 neipcfilu 24669 sltsbday 28360 zarclssn 34616 zar0ring 34621 elpaddat 41127 mnuprdlem1 45517 difmapsn 46498 ovnovollem1 47939 ovnovollem3 47941 |
| Copyright terms: Public domain | W3C validator |