| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > wrdsplex | Structured version Visualization version GIF version | ||
| Description: Existence of a split of a word at a given index. (Contributed by Thierry Arnoux, 11-Oct-2018.) (Proof shortened by AV, 3-Nov-2022.) |
| Ref | Expression |
|---|---|
| wrdsplex | ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → ∃𝑣 ∈ Word 𝑆𝑊 = ((𝑊 ↾ (0..^𝑁)) ++ 𝑣)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | swrdcl 14835 | . 2 ⊢ (𝑊 ∈ Word 𝑆 → (𝑊 substr 〈𝑁, (♯‘𝑊)〉) ∈ Word 𝑆) | |
| 2 | simpr 490 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → 𝑁 ∈ (0...(♯‘𝑊))) | |
| 3 | elfzuz2 13702 | . . . . 5 ⊢ (𝑁 ∈ (0...(♯‘𝑊)) → (♯‘𝑊) ∈ (ℤ≥‘0)) | |
| 4 | eluzfz2 13705 | . . . . 5 ⊢ ((♯‘𝑊) ∈ (ℤ≥‘0) → (♯‘𝑊) ∈ (0...(♯‘𝑊))) | |
| 5 | 2, 3, 4 | 3syl 19 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → (♯‘𝑊) ∈ (0...(♯‘𝑊))) |
| 6 | ccatpfx 14892 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊)) ∧ (♯‘𝑊) ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 𝑁) ++ (𝑊 substr 〈𝑁, (♯‘𝑊)〉)) = (𝑊 prefix (♯‘𝑊))) | |
| 7 | 5, 6 | mpd3an3 1492 | . . 3 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 𝑁) ++ (𝑊 substr 〈𝑁, (♯‘𝑊)〉)) = (𝑊 prefix (♯‘𝑊))) |
| 8 | pfxres 14871 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → (𝑊 prefix 𝑁) = (𝑊 ↾ (0..^𝑁))) | |
| 9 | 8 | oveq1d 7466 | . . 3 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 𝑁) ++ (𝑊 substr 〈𝑁, (♯‘𝑊)〉)) = ((𝑊 ↾ (0..^𝑁)) ++ (𝑊 substr 〈𝑁, (♯‘𝑊)〉))) |
| 10 | pfxid 14876 | . . . 4 ⊢ (𝑊 ∈ Word 𝑆 → (𝑊 prefix (♯‘𝑊)) = 𝑊) | |
| 11 | 10 | adantr 486 | . . 3 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → (𝑊 prefix (♯‘𝑊)) = 𝑊) |
| 12 | 7, 9, 11 | 3eqtr3rd 2807 | . 2 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → 𝑊 = ((𝑊 ↾ (0..^𝑁)) ++ (𝑊 substr 〈𝑁, (♯‘𝑊)〉))) |
| 13 | oveq2 7459 | . . 3 ⊢ (𝑣 = (𝑊 substr 〈𝑁, (♯‘𝑊)〉) → ((𝑊 ↾ (0..^𝑁)) ++ 𝑣) = ((𝑊 ↾ (0..^𝑁)) ++ (𝑊 substr 〈𝑁, (♯‘𝑊)〉))) | |
| 14 | 13 | rspceeqv 3602 | . 2 ⊢ (((𝑊 substr 〈𝑁, (♯‘𝑊)〉) ∈ Word 𝑆 ∧ 𝑊 = ((𝑊 ↾ (0..^𝑁)) ++ (𝑊 substr 〈𝑁, (♯‘𝑊)〉))) → ∃𝑣 ∈ Word 𝑆𝑊 = ((𝑊 ↾ (0..^𝑁)) ++ 𝑣)) |
| 15 | 1, 12, 14 | syl2an2r 698 | 1 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑁 ∈ (0...(♯‘𝑊))) → ∃𝑣 ∈ Word 𝑆𝑊 = ((𝑊 ↾ (0..^𝑁)) ++ 𝑣)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 〈cop 4840 ↾ cres 5660 ‘cfv 6566 (class class class)co 7451 0cc0 11239 ℤ≥cuz 13005 ...cfz 13679 ..^cfzo 13828 ♯chash 14515 Word cword 14699 ++ cconcat 14756 substr csubstr 14830 prefix cpfx 14862 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-substr 14831 df-pfx 14863 |
| This theorem is used by: signstres 35315 |
| Copyright terms: Public domain | W3C validator |