| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s1nz | Structured version Visualization version GIF version | ||
| Description: A singleton word is not the empty string. (Contributed by Mario Carneiro, 27-Feb-2016.) (Proof shortened by Kyle Wyonch, 18-Jul-2021.) |
| Ref | Expression |
|---|---|
| s1nz | ⊢ 〈“𝐴”〉 ≠ ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-s1 14603 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
| 2 | opex 5428 | . . 3 ⊢ 〈0, ( I ‘𝐴)〉 ∈ V | |
| 3 | 2 | snnz 4732 | . 2 ⊢ {〈0, ( I ‘𝐴)〉} ≠ ∅ |
| 4 | 1, 3 | eqnetri 3026 | 1 ⊢ 〈“𝐴”〉 ≠ ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ≠ wne 2956 ∅c0 4283 {csn 4579 〈cop 4585 I cid 5537 ‘cfv 6515 0cc0 11066 〈“cs1 14602 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5243 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-sn 4580 df-pr 4582 df-op 4586 df-s1 14603 |
| This theorem is referenced by: lswccats1 14641 efgs1 19765 |
| Copyright terms: Public domain | W3C validator |