| 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 14377 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (0 < (♯‘𝑊) ↔ 𝑊 ≠ ∅)) | |
| 2 | lencl 14546 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 3 | nn0z 12592 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℕ0 → (♯‘𝑊) ∈ ℤ) | |
| 4 | elnnz 12578 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℕ ↔ ((♯‘𝑊) ∈ ℤ ∧ 0 < (♯‘𝑊))) | |
| 5 | fzo0end 13764 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℕ → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) | |
| 6 | 4, 5 | sylbir 237 | . . . . . . 7 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 0 < (♯‘𝑊)) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) |
| 7 | 6 | ex 416 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℤ → (0 < (♯‘𝑊) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊)))) |
| 8 | 2, 3, 7 | 3syl 18 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (0 < (♯‘𝑊) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊)))) |
| 9 | 1, 8 | sylbird 262 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ≠ ∅ → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊)))) |
| 10 | 9 | imp 410 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) |
| 11 | swrds1 14680 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) − 1) ∈ (0..^(♯‘𝑊))) → (𝑊 substr 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉) = 〈“(𝑊‘((♯‘𝑊) − 1))”〉) | |
| 12 | 10, 11 | syldan 600 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉) = 〈“(𝑊‘((♯‘𝑊) − 1))”〉) |
| 13 | nn0cn 12491 | . . . . . . 7 ⊢ ((♯‘𝑊) ∈ ℕ0 → (♯‘𝑊) ∈ ℂ) | |
| 14 | ax-1cn 11131 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 15 | 13, 14 | jctir 528 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℕ0 → ((♯‘𝑊) ∈ ℂ ∧ 1 ∈ ℂ)) |
| 16 | npcan 11439 | . . . . . . 7 ⊢ (((♯‘𝑊) ∈ ℂ ∧ 1 ∈ ℂ) → (((♯‘𝑊) − 1) + 1) = (♯‘𝑊)) | |
| 17 | 16 | eqcomd 2768 | . . . . . 6 ⊢ (((♯‘𝑊) ∈ ℂ ∧ 1 ∈ ℂ) → (♯‘𝑊) = (((♯‘𝑊) − 1) + 1)) |
| 18 | 2, 15, 17 | 3syl 18 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) = (((♯‘𝑊) − 1) + 1)) |
| 19 | 18 | adantr 484 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) = (((♯‘𝑊) − 1) + 1)) |
| 20 | 19 | opeq2d 4838 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → 〈((♯‘𝑊) − 1), (♯‘𝑊)〉 = 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉) |
| 21 | 20 | oveq2d 7412 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈((♯‘𝑊) − 1), (♯‘𝑊)〉) = (𝑊 substr 〈((♯‘𝑊) − 1), (((♯‘𝑊) − 1) + 1)〉)) |
| 22 | lsw 14577 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (lastS‘𝑊) = (𝑊‘((♯‘𝑊) − 1))) | |
| 23 | 22 | adantr 484 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (lastS‘𝑊) = (𝑊‘((♯‘𝑊) − 1))) |
| 24 | 23 | s1eqd 14615 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → 〈“(lastS‘𝑊)”〉 = 〈“(𝑊‘((♯‘𝑊) − 1))”〉) |
| 25 | 12, 21, 24 | 3eqtr4d 2807 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈((♯‘𝑊) − 1), (♯‘𝑊)〉) = 〈“(lastS‘𝑊)”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 ∅c0 4285 〈cop 4588 class class class wbr 5100 ‘cfv 6521 (class class class)co 7396 ℂcc 11071 0cc0 11073 1c1 11074 + caddc 11076 < clt 11216 − cmin 11414 ℕcn 12210 ℕ0cn0 12481 ℤcz 12568 ..^cfzo 13659 ♯chash 14343 Word cword 14526 lastSclsw 14575 〈“cs1 14609 substr csubstr 14654 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-card 9897 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-n0 12482 df-xnn0 12555 df-z 12569 df-uz 12840 df-fz 13513 df-fzo 13660 df-hash 14344 df-word 14527 df-lsw 14576 df-s1 14610 df-substr 14655 |
| This theorem is referenced by: pfxsuff1eqwrdeq 14712 pfxlswccat 14726 |
| Copyright terms: Public domain | W3C validator |