| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pfxswrd | Structured version Visualization version GIF version | ||
| Description: A prefix of a subword is a subword. (Contributed by AV, 2-Apr-2018.) (Revised by AV, 8-May-2020.) |
| Ref | Expression |
|---|---|
| pfxswrd | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) → (𝐿 ∈ (0...(𝑁 − 𝑀)) → ((𝑊 substr 〈𝑀, 𝑁〉) prefix 𝐿) = (𝑊 substr 〈𝑀, (𝑀 + 𝐿)〉))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ovexd 7449 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 substr 〈𝑀, 𝑁〉) ∈ V) | |
| 2 | elfznn0 13678 | . . . 4 ⊢ (𝐿 ∈ (0...(𝑁 − 𝑀)) → 𝐿 ∈ ℕ0) | |
| 3 | pfxval 14746 | . . . 4 ⊢ (((𝑊 substr 〈𝑀, 𝑁〉) ∈ V ∧ 𝐿 ∈ ℕ0) → ((𝑊 substr 〈𝑀, 𝑁〉) prefix 𝐿) = ((𝑊 substr 〈𝑀, 𝑁〉) substr 〈0, 𝐿〉)) | |
| 4 | 1, 2, 3 | syl2an 608 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → ((𝑊 substr 〈𝑀, 𝑁〉) prefix 𝐿) = ((𝑊 substr 〈𝑀, 𝑁〉) substr 〈0, 𝐿〉)) |
| 5 | fznn0sub 13614 | . . . . . . 7 ⊢ (𝑀 ∈ (0...𝑁) → (𝑁 − 𝑀) ∈ ℕ0) | |
| 6 | 5 | 3ad2ant3 1153 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) → (𝑁 − 𝑀) ∈ ℕ0) |
| 7 | 0elfz 13682 | . . . . . 6 ⊢ ((𝑁 − 𝑀) ∈ ℕ0 → 0 ∈ (0...(𝑁 − 𝑀))) | |
| 8 | 6, 7 | syl 18 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) → 0 ∈ (0...(𝑁 − 𝑀))) |
| 9 | 8 | anim1i 627 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → (0 ∈ (0...(𝑁 − 𝑀)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀)))) |
| 10 | swrdswrd 14777 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) → ((0 ∈ (0...(𝑁 − 𝑀)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → ((𝑊 substr 〈𝑀, 𝑁〉) substr 〈0, 𝐿〉) = (𝑊 substr 〈(𝑀 + 0), (𝑀 + 𝐿)〉))) | |
| 11 | 10 | imp 412 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ (0 ∈ (0...(𝑁 − 𝑀)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀)))) → ((𝑊 substr 〈𝑀, 𝑁〉) substr 〈0, 𝐿〉) = (𝑊 substr 〈(𝑀 + 0), (𝑀 + 𝐿)〉)) |
| 12 | 9, 11 | syldan 603 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → ((𝑊 substr 〈𝑀, 𝑁〉) substr 〈0, 𝐿〉) = (𝑊 substr 〈(𝑀 + 0), (𝑀 + 𝐿)〉)) |
| 13 | elfznn0 13678 | . . . . . . . 8 ⊢ (𝑀 ∈ (0...𝑁) → 𝑀 ∈ ℕ0) | |
| 14 | nn0cn 12541 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℕ0 → 𝑀 ∈ ℂ) | |
| 15 | 14 | addridd 11437 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ0 → (𝑀 + 0) = 𝑀) |
| 16 | 13, 15 | syl 18 | . . . . . . 7 ⊢ (𝑀 ∈ (0...𝑁) → (𝑀 + 0) = 𝑀) |
| 17 | 16 | 3ad2ant3 1153 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) → (𝑀 + 0) = 𝑀) |
| 18 | 17 | adantr 486 | . . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → (𝑀 + 0) = 𝑀) |
| 19 | 18 | opeq1d 4839 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → 〈(𝑀 + 0), (𝑀 + 𝐿)〉 = 〈𝑀, (𝑀 + 𝐿)〉) |
| 20 | 19 | oveq2d 7430 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → (𝑊 substr 〈(𝑀 + 0), (𝑀 + 𝐿)〉) = (𝑊 substr 〈𝑀, (𝑀 + 𝐿)〉)) |
| 21 | 4, 12, 20 | 3eqtrd 2799 | . 2 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) ∧ 𝐿 ∈ (0...(𝑁 − 𝑀))) → ((𝑊 substr 〈𝑀, 𝑁〉) prefix 𝐿) = (𝑊 substr 〈𝑀, (𝑀 + 𝐿)〉)) |
| 22 | 21 | ex 418 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ 𝑀 ∈ (0...𝑁)) → (𝐿 ∈ (0...(𝑁 − 𝑀)) → ((𝑊 substr 〈𝑀, 𝑁〉) prefix 𝐿) = (𝑊 substr 〈𝑀, (𝑀 + 𝐿)〉))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3450 〈cop 4590 ‘cfv 6533 (class class class)co 7414 0cc0 11127 + caddc 11130 − cmin 11468 ℕ0cn0 12531 ...cfz 13564 ♯chash 14397 Word cword 14581 substr csubstr 14711 prefix cpfx 14743 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8458 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-n0 12532 df-z 12619 df-uz 12891 df-fz 13565 df-fzo 13713 df-hash 14398 df-word 14582 df-substr 14712 df-pfx 14744 |
| This theorem is used by: pfxpfx 14780 |
| Copyright terms: Public domain | W3C validator |