| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cats1fvd | GIF version | ||
| Description: A symbol other than the last in a concatenation with a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.) (Revised by Jim Kingdon, 20-Jan-2026.) |
| Ref | Expression |
|---|---|
| cats1cld.1 | ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) |
| cats1fvd.s | ⊢ (𝜑 → 𝑆 ∈ Word V) |
| cats1fvd.3 | ⊢ (𝜑 → (♯‘𝑆) = 𝑀) |
| cats1fvd.yex | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| cats1fvd.x | ⊢ (𝜑 → 𝑋 ∈ 𝑊) |
| cats1fvd.y | ⊢ (𝜑 → (𝑆‘𝑁) = 𝑌) |
| cats1fvd.5 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| cats1fvd.6 | ⊢ (𝜑 → 𝑁 < 𝑀) |
| Ref | Expression |
|---|---|
| cats1fvd | ⊢ (𝜑 → (𝑇‘𝑁) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cats1cld.1 | . . . 4 ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) | |
| 2 | 1 | fveq1i 5670 | . . 3 ⊢ (𝑇‘𝑁) = ((𝑆 ++ 〈“𝑋”〉)‘𝑁) |
| 3 | cats1fvd.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ Word V) | |
| 4 | cats1fvd.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑊) | |
| 5 | 4 | elexd 2826 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ V) |
| 6 | 5 | s1cld 11303 | . . . 4 ⊢ (𝜑 → 〈“𝑋”〉 ∈ Word V) |
| 7 | cats1fvd.5 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 8 | nn0uz 9885 | . . . . . 6 ⊢ ℕ0 = (ℤ≥‘0) | |
| 9 | 7, 8 | eleqtrdi 2325 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0)) |
| 10 | lencl 11221 | . . . . . 6 ⊢ (𝑆 ∈ Word V → (♯‘𝑆) ∈ ℕ0) | |
| 11 | nn0z 9593 | . . . . . 6 ⊢ ((♯‘𝑆) ∈ ℕ0 → (♯‘𝑆) ∈ ℤ) | |
| 12 | 3, 10, 11 | 3syl 17 | . . . . 5 ⊢ (𝜑 → (♯‘𝑆) ∈ ℤ) |
| 13 | cats1fvd.6 | . . . . . 6 ⊢ (𝜑 → 𝑁 < 𝑀) | |
| 14 | cats1fvd.3 | . . . . . 6 ⊢ (𝜑 → (♯‘𝑆) = 𝑀) | |
| 15 | 13, 14 | breqtrrd 4136 | . . . . 5 ⊢ (𝜑 → 𝑁 < (♯‘𝑆)) |
| 16 | elfzo2 10480 | . . . . 5 ⊢ (𝑁 ∈ (0..^(♯‘𝑆)) ↔ (𝑁 ∈ (ℤ≥‘0) ∧ (♯‘𝑆) ∈ ℤ ∧ 𝑁 < (♯‘𝑆))) | |
| 17 | 9, 12, 15, 16 | syl3anbrc 1208 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝑆))) |
| 18 | ccatval1 11278 | . . . 4 ⊢ ((𝑆 ∈ Word V ∧ 〈“𝑋”〉 ∈ Word V ∧ 𝑁 ∈ (0..^(♯‘𝑆))) → ((𝑆 ++ 〈“𝑋”〉)‘𝑁) = (𝑆‘𝑁)) | |
| 19 | 3, 6, 17, 18 | syl3anc 1274 | . . 3 ⊢ (𝜑 → ((𝑆 ++ 〈“𝑋”〉)‘𝑁) = (𝑆‘𝑁)) |
| 20 | 2, 19 | eqtrid 2277 | . 2 ⊢ (𝜑 → (𝑇‘𝑁) = (𝑆‘𝑁)) |
| 21 | cats1fvd.y | . 2 ⊢ (𝜑 → (𝑆‘𝑁) = 𝑌) | |
| 22 | 20, 21 | eqtrd 2265 | 1 ⊢ (𝜑 → (𝑇‘𝑁) = 𝑌) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 Vcvv 2812 class class class wbr 4108 ‘cfv 5351 (class class class)co 6049 0cc0 8123 < clt 8304 ℕ0cn0 9492 ℤcz 9573 ℤ≥cuz 9849 ..^cfzo 10472 ♯chash 11133 Word cword 11217 ++ cconcat 11271 〈“cs1 11296 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-addcom 8223 ax-addass 8225 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-0id 8231 ax-rnegex 8232 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-apti 8238 ax-pre-ltadd 8239 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-1o 6646 df-er 6766 df-en 6975 df-dom 6976 df-fin 6977 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-inn 9234 df-n0 9493 df-z 9574 df-uz 9850 df-fz 10339 df-fzo 10473 df-ihash 11134 df-word 11218 df-concat 11272 df-s1 11297 |
| This theorem is referenced by: s2fv0g 11472 s3fv0g 11476 s3fv1g 11477 |
| Copyright terms: Public domain | W3C validator |