| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cats1fvnd | GIF version | ||
| Description: The last symbol of a concatenation with a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.) (Revised by Jim Kingdon, 20-Jan-2026.) |
| Ref | Expression |
|---|---|
| cats1cld.1 | ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) |
| cats1fvnd.2 | ⊢ (𝜑 → 𝑆 ∈ Word V) |
| cats1fvnd.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| cats1fvnd.3 | ⊢ (𝜑 → (♯‘𝑆) = 𝑀) |
| Ref | Expression |
|---|---|
| cats1fvnd | ⊢ (𝜑 → (𝑇‘𝑀) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cats1cld.1 | . . . 4 ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) | |
| 2 | 1 | a1i 9 | . . 3 ⊢ (𝜑 → 𝑇 = (𝑆 ++ 〈“𝑋”〉)) |
| 3 | cats1fvnd.2 | . . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ Word V) | |
| 4 | lencl 11291 | . . . . . . 7 ⊢ (𝑆 ∈ Word V → (♯‘𝑆) ∈ ℕ0) | |
| 5 | 3, 4 | syl 14 | . . . . . 6 ⊢ (𝜑 → (♯‘𝑆) ∈ ℕ0) |
| 6 | 5 | nn0cnd 9605 | . . . . 5 ⊢ (𝜑 → (♯‘𝑆) ∈ ℂ) |
| 7 | 6 | addlidd 8470 | . . . 4 ⊢ (𝜑 → (0 + (♯‘𝑆)) = (♯‘𝑆)) |
| 8 | cats1fvnd.3 | . . . 4 ⊢ (𝜑 → (♯‘𝑆) = 𝑀) | |
| 9 | 7, 8 | eqtr2d 2272 | . . 3 ⊢ (𝜑 → 𝑀 = (0 + (♯‘𝑆))) |
| 10 | 2, 9 | fveq12d 5700 | . 2 ⊢ (𝜑 → (𝑇‘𝑀) = ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆)))) |
| 11 | cats1fvnd.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 12 | elex 2833 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V) | |
| 13 | 12 | s1cld 11373 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → 〈“𝑋”〉 ∈ Word V) |
| 14 | 11, 13 | syl 14 | . . 3 ⊢ (𝜑 → 〈“𝑋”〉 ∈ Word V) |
| 15 | s1leng 11375 | . . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (♯‘〈“𝑋”〉) = 1) | |
| 16 | 1nn 9298 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 17 | 15, 16 | eqeltrdi 2329 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (♯‘〈“𝑋”〉) ∈ ℕ) |
| 18 | lbfzo0 10575 | . . . . 5 ⊢ (0 ∈ (0..^(♯‘〈“𝑋”〉)) ↔ (♯‘〈“𝑋”〉) ∈ ℕ) | |
| 19 | 17, 18 | sylibr 134 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → 0 ∈ (0..^(♯‘〈“𝑋”〉))) |
| 20 | 11, 19 | syl 14 | . . 3 ⊢ (𝜑 → 0 ∈ (0..^(♯‘〈“𝑋”〉))) |
| 21 | ccatval3 11350 | . . 3 ⊢ ((𝑆 ∈ Word V ∧ 〈“𝑋”〉 ∈ Word V ∧ 0 ∈ (0..^(♯‘〈“𝑋”〉))) → ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) = (〈“𝑋”〉‘0)) | |
| 22 | 3, 14, 20, 21 | syl3anc 1278 | . 2 ⊢ (𝜑 → ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) = (〈“𝑋”〉‘0)) |
| 23 | s1fv 11377 | . . 3 ⊢ (𝑋 ∈ 𝑉 → (〈“𝑋”〉‘0) = 𝑋) | |
| 24 | 11, 23 | syl 14 | . 2 ⊢ (𝜑 → (〈“𝑋”〉‘0) = 𝑋) |
| 25 | 10, 22, 24 | 3eqtrd 2275 | 1 ⊢ (𝜑 → (𝑇‘𝑀) = 𝑋) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ‘cfv 5375 (class class class)co 6079 0cc0 8173 1c1 8174 + caddc 8176 ℕcn 9287 ℕ0cn0 9546 ..^cfzo 10532 ♯chash 11197 Word cword 11287 ++ cconcat 11341 〈“cs1 11366 |
| This theorem was proved from 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 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 |
| This theorem 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 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-ilim 4512 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-recs 6570 df-frec 6656 df-1o 6681 df-er 6801 df-en 7017 df-dom 7018 df-fin 7019 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-n0 9547 df-z 9628 df-uz 9905 df-fz 10395 df-fzo 10533 df-ihash 11198 df-word 11288 df-concat 11342 df-s1 11367 |
| This theorem is referenced by: s2fv1g 11543 s3fv2g 11548 |
| Copyright terms: Public domain | W3C validator |