Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > swrdlsw | Structured version Visualization version GIF version |
Description: Extract the last single symbol from a word. (Contributed by Alexander van der Vekens, 23-Sep-2018.) |
Ref | Expression |
---|---|
swrdlsw | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈((♯‘𝑊) − 1), (♯‘𝑊)〉) = 〈“(lastS‘𝑊)”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hashneq0 14007 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (0 < (♯‘𝑊) ↔ 𝑊 ≠ ∅)) | |
2 | lencl 14164 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
3 | nn0z 12273 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℕ0 → (♯‘𝑊) ∈ ℤ) | |
4 | elnnz 12259 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℕ ↔ ((♯‘𝑊) ∈ ℤ ∧ 0 < (♯‘𝑊))) | |
5 | fzo0end 13407 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℕ → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) | |
6 | 4, 5 | sylbir 234 | . . . . . . 7 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 0 < (♯‘𝑊)) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) |
7 | 6 | ex 412 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℤ → (0 < (♯‘𝑊) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊)))) |
8 | 2, 3, 7 | 3syl 18 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (0 < (♯‘𝑊) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊)))) |
9 | 1, 8 | sylbird 259 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ≠ ∅ → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊)))) |
10 | 9 | imp 406 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) |
11 | swrds1 14307 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) → (𝑊 substr 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉) = 〈“(𝑊‘((♯‘𝑊) − 1))”〉) | |
12 | 10, 11 | syldan 590 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉) = 〈“(𝑊‘((♯‘𝑊) − 1))”〉) |
13 | nn0cn 12173 | . . . . . . 7 ⊢ ((♯‘𝑊) ∈ ℕ0 → (♯‘𝑊) ∈ ℂ) | |
14 | ax-1cn 10860 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
15 | 13, 14 | jctir 520 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℕ0 → ((♯‘𝑊) ∈ ℂ ∧ 1 ∈ ℂ)) |
16 | npcan 11160 | . . . . . . 7 ⊢ (((♯‘𝑊) ∈ ℂ ∧ 1 ∈ ℂ) → (((♯‘𝑊) − 1) + 1) = (♯‘𝑊)) | |
17 | 16 | eqcomd 2744 | . . . . . 6 ⊢ (((♯‘𝑊) ∈ ℂ ∧ 1 ∈ ℂ) → (♯‘𝑊) = (((♯‘𝑊) − 1) + 1)) |
18 | 2, 15, 17 | 3syl 18 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) = (((♯‘𝑊) − 1) + 1)) |
19 | 18 | adantr 480 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) = (((♯‘𝑊) − 1) + 1)) |
20 | 19 | opeq2d 4808 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → 〈((♯‘𝑊) − 1), (♯‘𝑊)〉 = 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉) |
21 | 20 | oveq2d 7271 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈((♯‘𝑊) − 1), (♯‘𝑊)〉) = (𝑊 substr 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉)) |
22 | lsw 14195 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (lastS‘𝑊) = (𝑊‘((♯‘𝑊) − 1))) | |
23 | 22 | adantr 480 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (lastS‘𝑊) = (𝑊‘((♯‘𝑊) − 1))) |
24 | 23 | s1eqd 14234 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → 〈“(lastS‘𝑊)”〉 = 〈“(𝑊‘((♯‘𝑊) − 1))”〉) |
25 | 12, 21, 24 | 3eqtr4d 2788 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈((♯‘𝑊) − 1), (♯‘𝑊)〉) = 〈“(lastS‘𝑊)”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∅c0 4253 〈cop 4564 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 0cc0 10802 1c1 10803 + caddc 10805 < clt 10940 − cmin 11135 ℕcn 11903 ℕ0cn0 12163 ℤcz 12249 ..^cfzo 13311 ♯chash 13972 Word cword 14145 lastSclsw 14193 〈“cs1 14228 substr csubstr 14281 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-xnn0 12236 df-z 12250 df-uz 12512 df-fz 13169 df-fzo 13312 df-hash 13973 df-word 14146 df-lsw 14194 df-s1 14229 df-substr 14282 |
This theorem is referenced by: pfxsuff1eqwrdeq 14340 pfxlswccat 14354 |
Copyright terms: Public domain | W3C validator |