| 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 14577 | . . . . . . 7 ⊢ (𝑆 ∈ Word 𝐵 → (♯‘𝑆) ∈ ℕ0) | |
| 2 | 1 | nn0zd 12622 | . . . . . 6 ⊢ (𝑆 ∈ Word 𝐵 → (♯‘𝑆) ∈ ℤ) |
| 3 | 2 | anim1ci 627 | . . . . 5 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝐼 ∈ (0..^(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℤ)) |
| 4 | 3 | 3adant2 1148 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝐼 ∈ (0..^(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℤ)) |
| 5 | fzo0addelr 13755 | . . . 4 ⊢ ((𝐼 ∈ (0..^(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℤ) → (𝐼 + (♯‘𝑆)) ∈ ((♯‘𝑆)..^((♯‘𝑆) + (♯‘𝑇)))) | |
| 6 | 4, 5 | syl 18 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝐼 + (♯‘𝑆)) ∈ ((♯‘𝑆)..^((♯‘𝑆) + (♯‘𝑇)))) |
| 7 | ccatval2 14622 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ (𝐼 + (♯‘𝑆)) ∈ ((♯‘𝑆)..^((♯‘𝑆) + (♯‘𝑇)))) → ((𝑆 ++ 𝑇)‘(𝐼 + (♯‘𝑆))) = (𝑇‘((𝐼 + (♯‘𝑆)) − (♯‘𝑆)))) | |
| 8 | 6, 7 | syld3an3 1435 | . 2 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(𝐼 + (♯‘𝑆))) = (𝑇‘((𝐼 + (♯‘𝑆)) − (♯‘𝑆)))) |
| 9 | elfzoelz 13694 | . . . . . 6 ⊢ (𝐼 ∈ (0..^(♯‘𝑇)) → 𝐼 ∈ ℤ) | |
| 10 | 9 | 3ad2ant3 1152 | . . . . 5 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → 𝐼 ∈ ℤ) |
| 11 | 10 | zcnd 12707 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → 𝐼 ∈ ℂ) |
| 12 | 1 | 3ad2ant1 1150 | . . . . 5 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (♯‘𝑆) ∈ ℕ0) |
| 13 | 12 | nn0cnd 12573 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (♯‘𝑆) ∈ ℂ) |
| 14 | 11, 13 | pncand 11576 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → ((𝐼 + (♯‘𝑆)) − (♯‘𝑆)) = 𝐼) |
| 15 | 14 | fveq2d 6885 | . 2 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → (𝑇‘((𝐼 + (♯‘𝑆)) − (♯‘𝑆))) = (𝑇‘𝐼)) |
| 16 | 8, 15 | eqtrd 2797 | 1 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑇 ∈ Word 𝐵 ∧ 𝐼 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(𝐼 + (♯‘𝑆))) = (𝑇‘𝐼)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ‘cfv 6536 (class class class)co 7412 0cc0 11106 + caddc 11109 − cmin 11447 ℕ0cn0 12510 ℤcz 12597 ..^cfzo 13689 ♯chash 14373 Word cword 14557 ++ cconcat 14614 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-n0 12511 df-z 12598 df-uz 12869 df-fz 13542 df-fzo 13690 df-hash 14374 df-word 14558 df-concat 14615 |
| This theorem is used by: ccatrn 14634 swrdccat2 14714 cats1un 14765 splfv2a 14800 revccat 14810 cats1fvn 14902 chnccat 18688 gsumsgrpccat 18905 efgsval2 19809 efgsp1 19813 pgpfaclem1 20159 2clwwlk2clwwlk 30712 splfv3 33287 lpadright 35083 |
| Copyright terms: Public domain | W3C validator |