| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ccats1val2 | 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 1028 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → 𝑊 ∈ Word 𝑉) | |
| 2 | s1cl 11411 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → 〈“𝑆”〉 ∈ Word 𝑉) | |
| 3 | 2 | 3ad2ant2 1050 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → 〈“𝑆”〉 ∈ Word 𝑉) |
| 4 | lencl 11330 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 5 | 4 | nn0zd 9777 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℤ) |
| 6 | elfzomin 10641 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℤ → (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + 1))) | |
| 7 | 1, 5, 6 | 3syl 17 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + 1))) |
| 8 | s1leng 11414 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → (♯‘〈“𝑆”〉) = 1) | |
| 9 | 8 | oveq2d 6104 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → ((♯‘𝑊) + (♯‘〈“𝑆”〉)) = ((♯‘𝑊) + 1)) |
| 10 | 9 | oveq2d 6104 | . . . . . 6 ⊢ (𝑆 ∈ 𝑉 → ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))) = ((♯‘𝑊)..^((♯‘𝑊) + 1))) |
| 11 | 10 | 3ad2ant2 1050 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))) = ((♯‘𝑊)..^((♯‘𝑊) + 1))) |
| 12 | 7, 11 | eleqtrrd 2318 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) |
| 13 | eleq1 2301 | . . . . 5 ⊢ (𝐼 = (♯‘𝑊) → (𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))) ↔ (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))))) | |
| 14 | 13 | 3ad2ant3 1051 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))) ↔ (♯‘𝑊) ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉))))) |
| 15 | 12, 14 | mpbird 167 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → 𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) |
| 16 | ccatval2 11388 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 〈“𝑆”〉 ∈ Word 𝑉 ∧ 𝐼 ∈ ((♯‘𝑊)..^((♯‘𝑊) + (♯‘〈“𝑆”〉)))) → ((𝑊 ++ 〈“𝑆”〉)‘𝐼) = (〈“𝑆”〉‘(𝐼 − (♯‘𝑊)))) | |
| 17 | 1, 3, 15, 16 | syl3anc 1278 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((𝑊 ++ 〈“𝑆”〉)‘𝐼) = (〈“𝑆”〉‘(𝐼 − (♯‘𝑊)))) |
| 18 | oveq1 6095 | . . . . 5 ⊢ (𝐼 = (♯‘𝑊) → (𝐼 − (♯‘𝑊)) = ((♯‘𝑊) − (♯‘𝑊))) | |
| 19 | 18 | 3ad2ant3 1051 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (𝐼 − (♯‘𝑊)) = ((♯‘𝑊) − (♯‘𝑊))) |
| 20 | 4 | nn0cnd 9633 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℂ) |
| 21 | 20 | subidd 8632 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → ((♯‘𝑊) − (♯‘𝑊)) = 0) |
| 22 | 21 | 3ad2ant1 1049 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((♯‘𝑊) − (♯‘𝑊)) = 0) |
| 23 | 19, 22 | eqtrd 2271 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (𝐼 − (♯‘𝑊)) = 0) |
| 24 | 23 | fveq2d 5702 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (〈“𝑆”〉‘(𝐼 − (♯‘𝑊))) = (〈“𝑆”〉‘0)) |
| 25 | s1fv 11416 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (〈“𝑆”〉‘0) = 𝑆) | |
| 26 | 25 | 3ad2ant2 1050 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → (〈“𝑆”〉‘0) = 𝑆) |
| 27 | 17, 24, 26 | 3eqtrd 2275 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑆 ∈ 𝑉 ∧ 𝐼 = (♯‘𝑊)) → ((𝑊 ++ 〈“𝑆”〉)‘𝐼) = 𝑆) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 0cc0 8185 1c1 8186 + caddc 8188 − cmin 8504 ℤcz 9655 ..^cfzo 10566 ♯chash 11236 Word cword 11326 ++ cconcat 11380 〈“cs1 11405 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-frec 6666 df-1o 6691 df-er 6811 df-en 7027 df-dom 7028 df-fin 7029 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-uz 9938 df-fz 10429 df-fzo 10567 df-ihash 11237 df-word 11327 df-concat 11381 df-s1 11406 |
| This theorem is used by: ccatws1ls 11432 ccatw2s1p1g 11435 ccatw2s1p2 11436 |
| Copyright terms: Public domain | W3C validator |