![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ccats1val2 | Structured version Visualization version GIF version |
Description: Value of the symbol concatenated with a word. (Contributed by Alexander van der Vekens, 5-Aug-2018.) (Proof shortened by Alexander van der Vekens, 14-Oct-2018.) |
Ref | Expression |
---|---|
ccats1val2 | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((𝑊 ++ 〈“𝑆”〉)‘𝐼) = 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1134 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → 𝑊 ∈ Word 𝑉) | |
2 | s1cl 14579 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → 〈“𝑆”〉 ∈ Word 𝑉) | |
3 | 2 | 3ad2ant2 1132 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → 〈“𝑆”〉 ∈ Word 𝑉) |
4 | lencl 14510 | . . . . . . . . 9 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
5 | 4 | nn0zd 12609 | . . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℤ) |
6 | elfzomin 13731 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℤ → (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + 1))) | |
7 | 5, 6 | syl 17 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + 1))) |
8 | s1len 14583 | . . . . . . . . 9 ⊢ (♯‘〈“𝑆”〉) = 1 | |
9 | 8 | oveq2i 7426 | . . . . . . . 8 ⊢ ((♯‘𝑊) + (♯‘〈“𝑆”〉)) = ((♯‘𝑊) + 1) |
10 | 9 | oveq2i 7426 | . . . . . . 7 ⊢ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))) = ((♯‘𝑊)..^((♯‘𝑊) + 1)) |
11 | 7, 10 | eleqtrrdi 2840 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) |
12 | 11 | adantr 480 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) |
13 | eleq1 2817 | . . . . . 6 ⊢ (𝐼 = (♯‘𝑊) → (𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))) ↔ (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))))) | |
14 | 13 | adantl 481 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))) ↔ (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))))) |
15 | 12, 14 | mpbird 257 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 = (♯‘𝑊)) → 𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) |
16 | 15 | 3adant2 1129 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → 𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) |
17 | ccatval2 14555 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 〈“𝑆”〉 ∈ Word 𝑉 ∧ 𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) → ((𝑊 ++ 〈“𝑆”〉)‘𝐼) = (〈“𝑆”〉‘(𝐼 − (♯‘𝑊)))) | |
18 | 1, 3, 16, 17 | syl3anc 1369 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((𝑊 ++ 〈“𝑆”〉)‘𝐼) = (〈“𝑆”〉‘(𝐼 − (♯‘𝑊)))) |
19 | oveq1 7422 | . . . . 5 ⊢ (𝐼 = (♯‘𝑊) → (𝐼 − (♯‘𝑊)) = ((♯‘𝑊) − (♯‘𝑊))) | |
20 | 19 | 3ad2ant3 1133 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (𝐼 − (♯‘𝑊)) = ((♯‘𝑊) − (♯‘𝑊))) |
21 | 4 | nn0cnd 12559 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℂ) |
22 | 21 | subidd 11584 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → ((♯‘𝑊) − (♯‘𝑊)) = 0) |
23 | 22 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((♯‘𝑊) − (♯‘𝑊)) = 0) |
24 | 20, 23 | eqtrd 2768 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (𝐼 − (♯‘𝑊)) = 0) |
25 | 24 | fveq2d 6896 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (〈“𝑆”〉‘(𝐼 − (♯‘𝑊))) = (〈“𝑆”〉‘0)) |
26 | s1fv 14587 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (〈“𝑆”〉‘0) = 𝑆) | |
27 | 26 | 3ad2ant2 1132 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (〈“𝑆”〉‘0) = 𝑆) |
28 | 18, 25, 27 | 3eqtrd 2772 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((𝑊 ++ 〈“𝑆”〉)‘𝐼) = 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ‘cfv 6543 (class class class)co 7415 0cc0 11133 1c1 11134 + caddc 11136 − cmin 11469 ℤcz 12583 ..^cfzo 13654 ♯chash 14316 Word cword 14491 ++ cconcat 14547 〈“cs1 14572 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5360 ax-pr 5424 ax-un 7735 ax-cnex 11189 ax-resscn 11190 ax-1cn 11191 ax-icn 11192 ax-addcl 11193 ax-addrcl 11194 ax-mulcl 11195 ax-mulrcl 11196 ax-mulcom 11197 ax-addass 11198 ax-mulass 11199 ax-distr 11200 ax-i2m1 11201 ax-1ne0 11202 ax-1rid 11203 ax-rnegex 11204 ax-rrecex 11205 ax-cnre 11206 ax-pre-lttri 11207 ax-pre-lttrn 11208 ax-pre-ltadd 11209 ax-pre-mulgt0 11210 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3472 df-sbc 3776 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3964 df-nul 4320 df-if 4526 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4905 df-int 4946 df-iun 4994 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5571 df-eprel 5577 df-po 5585 df-so 5586 df-fr 5628 df-we 5630 df-xp 5679 df-rel 5680 df-cnv 5681 df-co 5682 df-dm 5683 df-rn 5684 df-res 5685 df-ima 5686 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-om 7866 df-1st 7988 df-2nd 7989 df-frecs 8281 df-wrecs 8312 df-recs 8386 df-rdg 8425 df-1o 8481 df-er 8719 df-en 8959 df-dom 8960 df-sdom 8961 df-fin 8962 df-card 9957 df-pnf 11275 df-mnf 11276 df-xr 11277 df-ltxr 11278 df-le 11279 df-sub 11471 df-neg 11472 df-nn 12238 df-n0 12498 df-z 12584 df-uz 12848 df-fz 13512 df-fzo 13655 df-hash 14317 df-word 14492 df-concat 14548 df-s1 14573 |
This theorem is referenced by: ccatws1ls 14610 ccatw2s1p1 14613 ccatw2s1p2 14614 gsmsymgrfixlem1 19376 gsmsymgreqlem2 19380 wwlksnext 29698 clwwlkwwlksb 29858 clwwlknonwwlknonb 29910 |
Copyright terms: Public domain | W3C validator |