| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cats1fvn | GIF version | ||
| Description: The last symbol of a concatenation with a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| cats1cld.1 | ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) |
| cats1cli.2 | ⊢ 𝑆 ∈ Word V |
| cats1fvn.3 | ⊢ (♯‘𝑆) = 𝑀 |
| Ref | Expression |
|---|---|
| cats1fvn | ⊢ (𝑋 ∈ 𝑉 → (𝑇‘𝑀) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cats1cld.1 | . . . 4 ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) | |
| 2 | cats1fvn.3 | . . . . . 6 ⊢ (♯‘𝑆) = 𝑀 | |
| 3 | 2 | oveq2i 6021 | . . . . 5 ⊢ (0 + (♯‘𝑆)) = (0 + 𝑀) |
| 4 | cats1cli.2 | . . . . . . . . 9 ⊢ 𝑆 ∈ Word V | |
| 5 | lencl 11093 | . . . . . . . . 9 ⊢ (𝑆 ∈ Word V → (♯‘𝑆) ∈ ℕ0) | |
| 6 | 4, 5 | ax-mp 5 | . . . . . . . 8 ⊢ (♯‘𝑆) ∈ ℕ0 |
| 7 | 2, 6 | eqeltrri 2303 | . . . . . . 7 ⊢ 𝑀 ∈ ℕ0 |
| 8 | 7 | nn0cni 9397 | . . . . . 6 ⊢ 𝑀 ∈ ℂ |
| 9 | 8 | addlidi 8305 | . . . . 5 ⊢ (0 + 𝑀) = 𝑀 |
| 10 | 3, 9 | eqtr2i 2251 | . . . 4 ⊢ 𝑀 = (0 + (♯‘𝑆)) |
| 11 | 1, 10 | fveq12i 5638 | . . 3 ⊢ (𝑇‘𝑀) = ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) |
| 12 | elex 2811 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V) | |
| 13 | 12 | s1cld 11175 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → 〈“𝑋”〉 ∈ Word V) |
| 14 | s1leng 11177 | . . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (♯‘〈“𝑋”〉) = 1) | |
| 15 | 1nn 9137 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 16 | 14, 15 | eqeltrdi 2320 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (♯‘〈“𝑋”〉) ∈ ℕ) |
| 17 | lbfzo0 10398 | . . . . 5 ⊢ (0 ∈ (0..^(♯‘〈“𝑋”〉)) ↔ (♯‘〈“𝑋”〉) ∈ ℕ) | |
| 18 | 16, 17 | sylibr 134 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → 0 ∈ (0..^(♯‘〈“𝑋”〉))) |
| 19 | ccatval3 11152 | . . . 4 ⊢ ((𝑆 ∈ Word V ∧ 〈“𝑋”〉 ∈ Word V ∧ 0 ∈ (0..^(♯‘〈“𝑋”〉))) → ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) = (〈“𝑋”〉‘0)) | |
| 20 | 4, 13, 18, 19 | mp3an2i 1376 | . . 3 ⊢ (𝑋 ∈ 𝑉 → ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) = (〈“𝑋”〉‘0)) |
| 21 | 11, 20 | eqtrid 2274 | . 2 ⊢ (𝑋 ∈ 𝑉 → (𝑇‘𝑀) = (〈“𝑋”〉‘0)) |
| 22 | s1fv 11179 | . 2 ⊢ (𝑋 ∈ 𝑉 → (〈“𝑋”〉‘0) = 𝑋) | |
| 23 | 21, 22 | eqtrd 2262 | 1 ⊢ (𝑋 ∈ 𝑉 → (𝑇‘𝑀) = 𝑋) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 Vcvv 2799 ‘cfv 5321 (class class class)co 6010 0cc0 8015 1c1 8016 + caddc 8018 ℕcn 9126 ℕ0cn0 9385 ..^cfzo 10355 ♯chash 11014 Word cword 11089 ++ cconcat 11143 〈“cs1 11168 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-iinf 4681 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-addcom 8115 ax-addass 8117 ax-distr 8119 ax-i2m1 8120 ax-0lt1 8121 ax-0id 8123 ax-rnegex 8124 ax-cnre 8126 ax-pre-ltirr 8127 ax-pre-ltwlin 8128 ax-pre-lttrn 8129 ax-pre-apti 8130 ax-pre-ltadd 8131 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4385 df-iord 4458 df-on 4460 df-ilim 4461 df-suc 4463 df-iom 4684 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-recs 6462 df-frec 6548 df-1o 6573 df-er 6693 df-en 6901 df-dom 6902 df-fin 6903 df-pnf 8199 df-mnf 8200 df-xr 8201 df-ltxr 8202 df-le 8203 df-sub 8335 df-neg 8336 df-inn 9127 df-n0 9386 df-z 9463 df-uz 9739 df-fz 10222 df-fzo 10356 df-ihash 11015 df-word 11090 df-concat 11144 df-s1 11169 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |