| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ccat2s1fvwALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of ccat2s1fvw 14672 using words of length 2, see df-s2 14881. A symbol of the concatenation of a word with two single symbols corresponding to the symbol of the word. (Contributed by AV, 22-Sep-2018.) (Proof shortened by Mario Carneiro/AV, 21-Oct-2018.) (Revised by AV, 28-Jan-2024.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| ccat2s1fvwALT | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘𝐼) = (𝑊‘𝐼)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ccatw2s1ccatws2 14987 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) = (𝑊 ++ 〈“𝑋𝑌”〉)) | |
| 2 | 1 | fveq1d 6883 | . . 3 ⊢ (𝑊 ∈ Word 𝑉 → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘𝐼) = ((𝑊 ++ 〈“𝑋𝑌”〉)‘𝐼)) |
| 3 | 2 | 3ad2ant1 1151 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘𝐼) = ((𝑊 ++ 〈“𝑋𝑌”〉)‘𝐼)) |
| 4 | simp1 1154 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 𝑊 ∈ Word 𝑉) | |
| 5 | s2cli 14913 | . . . 4 ⊢ 〈“𝑋𝑌”〉 ∈ Word V | |
| 6 | 5 | a1i 11 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 〈“𝑋𝑌”〉 ∈ Word V) |
| 7 | simp2 1155 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 𝐼 ∈ ℕ0) | |
| 8 | lencl 14566 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 9 | 8 | nn0zd 12611 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℤ) |
| 10 | 9 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → (♯‘𝑊) ∈ ℤ) |
| 11 | simp3 1156 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 𝐼 < (♯‘𝑊)) | |
| 12 | elfzo0z 13726 | . . . 4 ⊢ (𝐼 ∈ (0..^(♯‘𝑊)) ↔ (𝐼 ∈ ℕ0 ∧ (♯‘𝑊) ∈ ℤ ∧ 𝐼 < (♯‘𝑊))) | |
| 13 | 7, 10, 11, 12 | syl3anbrc 1362 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 𝐼 ∈ (0..^(♯‘𝑊))) |
| 14 | ccatval1 14610 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 〈“𝑋𝑌”〉 ∈ Word V ∧ 𝐼 ∈ (0..^(♯‘𝑊))) → ((𝑊 ++ 〈“𝑋𝑌”〉)‘𝐼) = (𝑊‘𝐼)) | |
| 15 | 4, 6, 13, 14 | syl3anc 1398 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → ((𝑊 ++ 〈“𝑋𝑌”〉)‘𝐼) = (𝑊‘𝐼)) |
| 16 | 3, 15 | eqtrd 2798 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘𝐼) = (𝑊‘𝐼)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 Vcvv 3455 class class class wbr 5109 ‘cfv 6536 (class class class)co 7410 0cc0 11095 < clt 11238 ℕ0cn0 12499 ℤcz 12586 ..^cfzo 13678 ♯chash 14362 Word cword 14546 ++ cconcat 14603 〈“cs1 14629 〈“cs2 14874 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-fz 13531 df-fzo 13679 df-hash 14363 df-word 14547 df-concat 14604 df-s1 14630 df-s2 14881 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |