| 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 14622 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
| 2 | opex 5435 | . . 3 ⊢ 〈0, ( I ‘𝐴)〉 ∈ V | |
| 3 | 2 | snnz 4738 | . 2 ⊢ {〈0, ( I ‘𝐴)〉} ≠ ∅ |
| 4 | 1, 3 | eqnetri 3030 | 1 ⊢ 〈“𝐴”〉 ≠ ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ≠ wne 2960 ∅c0 4288 {csn 4585 〈cop 4591 I cid 5545 ‘cfv 6525 0cc0 11088 〈“cs1 14621 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5250 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-sn 4586 df-pr 4588 df-op 4592 df-s1 14622 |
| This theorem is referenced by: lswccats1 14660 efgs1 19793 |
| Copyright terms: Public domain | W3C validator |