| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ccatval3 | Structured version Visualization version GIF version | ||
| Description: Value of a symbol in the right half of a concatenated word, using an index relative to the subword. (Contributed by Stefan O'Rear, 16-Aug-2015.) (Proof shortened by AV, 30-Apr-2020.) |
| Ref | Expression |
|---|---|
| ccatval3 | ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(𝐼 + (♯‘𝑆))) = (𝑇‘𝐼)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lencl 14440 | . . . . . . 7 ⊢ (𝑆 ∈ Word 𝐵 → (♯‘𝑆) ∈ ℕ0) | |
| 2 | 1 | nn0zd 12494 | . . . . . 6 ⊢ (𝑆 ∈ Word 𝐵 → (♯‘𝑆) ∈ ℤ) |
| 3 | 2 | anim1ci 616 | . . . . 5 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝐼 ∈ (0..^(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℤ)) |
| 4 | 3 | 3adant2 1131 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝐼 ∈ (0..^(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℤ)) |
| 5 | fzo0addelr 13619 | . . . 4 ⊢ ((𝐼 ∈ (0..^(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℤ) → (𝐼 + (♯‘𝑆)) ∈ ((♯‘𝑆)..^((♯‘𝑆) + (♯‘𝑇)))) | |
| 6 | 4, 5 | syl 17 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝐼 + (♯‘𝑆)) ∈ ((♯‘𝑆)..^((♯‘𝑆) + (♯‘𝑇)))) |
| 7 | ccatval2 14485 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ (𝐼 + (♯‘𝑆)) ∈ ((♯‘𝑆)..^((♯‘𝑆) + (♯‘𝑇)))) → ((𝑆 ++ 𝑇)‘(𝐼 + (♯‘𝑆))) = (𝑇‘((𝐼 + (♯‘𝑆)) − (♯‘𝑆)))) | |
| 8 | 6, 7 | syld3an3 1411 | . 2 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(𝐼 + (♯‘𝑆))) = (𝑇‘((𝐼 + (♯‘𝑆)) − (♯‘𝑆)))) |
| 9 | elfzoelz 13559 | . . . . . 6 ⊢ (𝐼 ∈ (0..^(♯‘𝑇)) → 𝐼 ∈ ℤ) | |
| 10 | 9 | 3ad2ant3 1135 | . . . . 5 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → 𝐼 ∈ ℤ) |
| 11 | 10 | zcnd 12578 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → 𝐼 ∈ ℂ) |
| 12 | 1 | 3ad2ant1 1133 | . . . . 5 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (♯‘𝑆) ∈ ℕ0) |
| 13 | 12 | nn0cnd 12444 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (♯‘𝑆) ∈ ℂ) |
| 14 | 11, 13 | pncand 11473 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → ((𝐼 + (♯‘𝑆)) − (♯‘𝑆)) = 𝐼) |
| 15 | 14 | fveq2d 6826 | . 2 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝑇‘((𝐼 + (♯‘𝑆)) − (♯‘𝑆))) = (𝑇‘𝐼)) |
| 16 | 8, 15 | eqtrd 2766 | 1 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(𝐼 + (♯‘𝑆))) = (𝑇‘𝐼)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ‘cfv 6481 (class class class)co 7346 0cc0 11006 + caddc 11009 − cmin 11344 ℕ0cn0 12381 ℤcz 12468 ..^cfzo 13554 ♯chash 14237 Word cword 14420 ++ cconcat 14477 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-card 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-n0 12382 df-z 12469 df-uz 12733 df-fz 13408 df-fzo 13555 df-hash 14238 df-word 14421 df-concat 14478 |
| This theorem is referenced by: ccatrn 14497 swrdccat2 14577 cats1un 14628 splfv2a 14663 revccat 14673 cats1fvn 14765 chnccat 18532 gsumsgrpccat 18748 efgsval2 19645 efgsp1 19649 pgpfaclem1 19995 2clwwlk2clwwlk 30330 splfv3 32939 lpadright 34697 |
| Copyright terms: Public domain | W3C validator |