| 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 6029 | . . . . 5 ⊢ (0 + (♯‘𝑆)) = (0 + 𝑀) |
| 4 | cats1cli.2 | . . . . . . . . 9 ⊢ 𝑆 ∈ Word V | |
| 5 | lencl 11118 | . . . . . . . . 9 ⊢ (𝑆 ∈ Word V → (♯‘𝑆) ∈ ℕ0) | |
| 6 | 4, 5 | ax-mp 5 | . . . . . . . 8 ⊢ (♯‘𝑆) ∈ ℕ0 |
| 7 | 2, 6 | eqeltrri 2305 | . . . . . . 7 ⊢ 𝑀 ∈ ℕ0 |
| 8 | 7 | nn0cni 9414 | . . . . . 6 ⊢ 𝑀 ∈ ℂ |
| 9 | 8 | addlidi 8322 | . . . . 5 ⊢ (0 + 𝑀) = 𝑀 |
| 10 | 3, 9 | eqtr2i 2253 | . . . 4 ⊢ 𝑀 = (0 + (♯‘𝑆)) |
| 11 | 1, 10 | fveq12i 5645 | . . 3 ⊢ (𝑇‘𝑀) = ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) |
| 12 | elex 2814 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V) | |
| 13 | 12 | s1cld 11200 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → 〈“𝑋”〉 ∈ Word V) |
| 14 | s1leng 11202 | . . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (♯‘〈“𝑋”〉) = 1) | |
| 15 | 1nn 9154 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 16 | 14, 15 | eqeltrdi 2322 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (♯‘〈“𝑋”〉) ∈ ℕ) |
| 17 | lbfzo0 10420 | . . . . 5 ⊢ (0 ∈ (0..^(♯‘〈“𝑋”〉)) ↔ (♯‘〈“𝑋”〉) ∈ ℕ) | |
| 18 | 16, 17 | sylibr 134 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → 0 ∈ (0..^(♯‘〈“𝑋”〉))) |
| 19 | ccatval3 11177 | . . . 4 ⊢ ((𝑆 ∈ Word V ∧ 〈“𝑋”〉 ∈ Word V ∧ 0 ∈ (0..^(♯‘〈“𝑋”〉))) → ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) = (〈“𝑋”〉‘0)) | |
| 20 | 4, 13, 18, 19 | mp3an2i 1378 | . . 3 ⊢ (𝑋 ∈ 𝑉 → ((𝑆 ++ 〈“𝑋”〉)‘(0 + (♯‘𝑆))) = (〈“𝑋”〉‘0)) |
| 21 | 11, 20 | eqtrid 2276 | . 2 ⊢ (𝑋 ∈ 𝑉 → (𝑇‘𝑀) = (〈“𝑋”〉‘0)) |
| 22 | s1fv 11204 | . 2 ⊢ (𝑋 ∈ 𝑉 → (〈“𝑋”〉‘0) = 𝑋) | |
| 23 | 21, 22 | eqtrd 2264 | 1 ⊢ (𝑋 ∈ 𝑉 → (𝑇‘𝑀) = 𝑋) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 Vcvv 2802 ‘cfv 5326 (class class class)co 6018 0cc0 8032 1c1 8033 + caddc 8035 ℕcn 9143 ℕ0cn0 9402 ..^cfzo 10377 ♯chash 11038 Word cword 11114 ++ cconcat 11168 〈“cs1 11193 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-1o 6582 df-er 6702 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-n0 9403 df-z 9480 df-uz 9756 df-fz 10244 df-fzo 10378 df-ihash 11039 df-word 11115 df-concat 11169 df-s1 11194 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |