| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ccat2s1p2 | Structured version Visualization version GIF version | ||
| Description: Extract the second of two concatenated singleton words. (Contributed by Alexander van der Vekens, 22-Sep-2018.) (Revised by JJ, 20-Jan-2024.) |
| Ref | Expression |
|---|---|
| ccat2s1p2 | ⊢ (𝑌 ∈ 𝑉 → ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | s1cli 14633 | . . . 4 ⊢ 〈“𝑋”〉 ∈ Word V | |
| 2 | s1cli 14633 | . . . 4 ⊢ 〈“𝑌”〉 ∈ Word V | |
| 3 | 1z 12615 | . . . . . 6 ⊢ 1 ∈ ℤ | |
| 4 | 2z 12617 | . . . . . 6 ⊢ 2 ∈ ℤ | |
| 5 | 1lt2 12404 | . . . . . 6 ⊢ 1 < 2 | |
| 6 | fzolb 13685 | . . . . . 6 ⊢ (1 ∈ (1..^2) ↔ (1 ∈ ℤ ∧ 2 ∈ ℤ ∧ 1 < 2)) | |
| 7 | 3, 4, 5, 6 | mpbir3an 1358 | . . . . 5 ⊢ 1 ∈ (1..^2) |
| 8 | s1len 14634 | . . . . . 6 ⊢ (♯‘〈“𝑋”〉) = 1 | |
| 9 | s1len 14634 | . . . . . . . 8 ⊢ (♯‘〈“𝑌”〉) = 1 | |
| 10 | 8, 9 | oveq12i 7412 | . . . . . . 7 ⊢ ((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉)) = (1 + 1) |
| 11 | 1p1e2 12355 | . . . . . . 7 ⊢ (1 + 1) = 2 | |
| 12 | 10, 11 | eqtri 2788 | . . . . . 6 ⊢ ((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉)) = 2 |
| 13 | 8, 12 | oveq12i 7412 | . . . . 5 ⊢ ((♯‘〈“𝑋”〉)..^((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉))) = (1..^2) |
| 14 | 7, 13 | eleqtrri 2864 | . . . 4 ⊢ 1 ∈ ((♯‘〈“𝑋”〉)..^((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉))) |
| 15 | ccatval2 14605 | . . . 4 ⊢ ((〈“𝑋”〉 ∈ Word V ∧ 〈“𝑌”〉 ∈ Word V ∧ 1 ∈ ((♯‘〈“𝑋”〉)..^((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉)))) → ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉)))) | |
| 16 | 1, 2, 14, 15 | mp3an 1485 | . . 3 ⊢ ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉))) |
| 17 | 8 | oveq2i 7411 | . . . . 5 ⊢ (1 − (♯‘〈“𝑋”〉)) = (1 − 1) |
| 18 | 1m1e0 12304 | . . . . 5 ⊢ (1 − 1) = 0 | |
| 19 | 17, 18 | eqtri 2788 | . . . 4 ⊢ (1 − (♯‘〈“𝑋”〉)) = 0 |
| 20 | 19 | fveq2i 6874 | . . 3 ⊢ (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉))) = (〈“𝑌”〉‘0) |
| 21 | 16, 20 | eqtri 2788 | . 2 ⊢ ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = (〈“𝑌”〉‘0) |
| 22 | s1fv 14638 | . 2 ⊢ (𝑌 ∈ 𝑉 → (〈“𝑌”〉‘0) = 𝑌) | |
| 23 | 21, 22 | eqtrid 2812 | 1 ⊢ (𝑌 ∈ 𝑉 → ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 Vcvv 3457 class class class wbr 5105 ‘cfv 6525 (class class class)co 7400 0cc0 11088 1c1 11089 + caddc 11091 < clt 11231 − cmin 11429 2c2 12286 ℤcz 12582 ..^cfzo 13673 ♯chash 14357 Word cword 14540 ++ cconcat 14597 〈“cs1 14623 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-n0 12496 df-z 12583 df-uz 12854 df-fz 13527 df-fzo 13674 df-hash 14358 df-word 14541 df-concat 14598 df-s1 14624 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |