Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ccat2s1fvwOLD | Structured version Visualization version GIF version |
Description: Obsolete version of ccat2s1fvw 13994 as of 28-Jan-2024. Extract a symbol of a word from the concatenation of the word with two single symbols. (Contributed by AV, 22-Sep-2018.) (Revised by AV, 13-Jan-2020.) (Proof shortened by AV, 1-May-2020.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
ccat2s1fvwOLD | ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘𝐼) = (𝑊‘𝐼)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ccatw2s1assOLD 13986 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) = (𝑊 ++ (〈“𝑋”〉 ++ 〈“𝑌”〉))) | |
2 | 1 | 3expb 1115 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) = (𝑊 ++ (〈“𝑋”〉 ++ 〈“𝑌”〉))) |
3 | 2 | 3ad2antl1 1180 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉) = (𝑊 ++ (〈“𝑋”〉 ++ 〈“𝑌”〉))) |
4 | 3 | fveq1d 6669 | . 2 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘𝐼) = ((𝑊 ++ (〈“𝑋”〉 ++ 〈“𝑌”〉))‘𝐼)) |
5 | simpl1 1186 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝑊 ∈ Word 𝑉) | |
6 | ccat2s1cl 13968 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (〈“𝑋”〉 ++ 〈“𝑌”〉) ∈ Word 𝑉) | |
7 | 6 | adantl 484 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (〈“𝑋”〉 ++ 〈“𝑌”〉) ∈ Word 𝑉) |
8 | simp2 1132 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 𝐼 ∈ ℕ0) | |
9 | lencl 13879 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
10 | 9 | 3ad2ant1 1128 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → (♯‘𝑊) ∈ ℕ0) |
11 | nn0ge0 11920 | . . . . . . . . 9 ⊢ (𝐼 ∈ ℕ0 → 0 ≤ 𝐼) | |
12 | 11 | adantl 484 | . . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0) → 0 ≤ 𝐼) |
13 | 0red 10641 | . . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0) → 0 ∈ ℝ) | |
14 | nn0re 11904 | . . . . . . . . . 10 ⊢ (𝐼 ∈ ℕ0 → 𝐼 ∈ ℝ) | |
15 | 14 | adantl 484 | . . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0) → 𝐼 ∈ ℝ) |
16 | 9 | nn0red 11954 | . . . . . . . . . 10 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℝ) |
17 | 16 | adantr 483 | . . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0) → (♯‘𝑊) ∈ ℝ) |
18 | lelttr 10728 | . . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 𝐼 ∈ ℝ ∧ (♯‘𝑊) ∈ ℝ) → ((0 ≤ 𝐼 ∧ 𝐼 < (♯‘𝑊)) → 0 < (♯‘𝑊))) | |
19 | 13, 15, 17, 18 | syl3anc 1366 | . . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0) → ((0 ≤ 𝐼 ∧ 𝐼 < (♯‘𝑊)) → 0 < (♯‘𝑊))) |
20 | 12, 19 | mpand 693 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0) → (𝐼 < (♯‘𝑊) → 0 < (♯‘𝑊))) |
21 | 20 | 3impia 1112 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 0 < (♯‘𝑊)) |
22 | elnnnn0b 11939 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℕ ↔ ((♯‘𝑊) ∈ ℕ0 ∧ 0 < (♯‘𝑊))) | |
23 | 10, 21, 22 | sylanbrc 585 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → (♯‘𝑊) ∈ ℕ) |
24 | simp3 1133 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 𝐼 < (♯‘𝑊)) | |
25 | elfzo0 13076 | . . . . 5 ⊢ (𝐼 ∈ (0..^(♯‘𝑊)) ↔ (𝐼 ∈ ℕ0 ∧ (♯‘𝑊) ∈ ℕ ∧ 𝐼 < (♯‘𝑊))) | |
26 | 8, 23, 24, 25 | syl3anbrc 1338 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) → 𝐼 ∈ (0..^(♯‘𝑊))) |
27 | 26 | adantr 483 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝐼 ∈ (0..^(♯‘𝑊))) |
28 | ccatval1 13926 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (〈“𝑋”〉 ++ 〈“𝑌”〉) ∈ Word 𝑉 ∧ 𝐼 ∈ (0..^(♯‘𝑊))) → ((𝑊 ++ (〈“𝑋”〉 ++ 〈“𝑌”〉))‘𝐼) = (𝑊‘𝐼)) | |
29 | 5, 7, 27, 28 | syl3anc 1366 | . 2 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ((𝑊 ++ (〈“𝑋”〉 ++ 〈“𝑌”〉))‘𝐼) = (𝑊‘𝐼)) |
30 | 4, 29 | eqtrd 2855 | 1 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℕ0 ∧ 𝐼 < (♯‘𝑊)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (((𝑊 ++ 〈“𝑋”〉) ++ 〈“𝑌”〉)‘𝐼) = (𝑊‘𝐼)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1082 = wceq 1536 ∈ wcel 2113 class class class wbr 5063 ‘cfv 6352 (class class class)co 7153 ℝcr 10533 0cc0 10534 < clt 10672 ≤ cle 10673 ℕcn 11635 ℕ0cn0 11895 ..^cfzo 13031 ♯chash 13688 Word cword 13859 ++ cconcat 13918 〈“cs1 13945 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-rep 5187 ax-sep 5200 ax-nul 5207 ax-pow 5263 ax-pr 5327 ax-un 7458 ax-cnex 10590 ax-resscn 10591 ax-1cn 10592 ax-icn 10593 ax-addcl 10594 ax-addrcl 10595 ax-mulcl 10596 ax-mulrcl 10597 ax-mulcom 10598 ax-addass 10599 ax-mulass 10600 ax-distr 10601 ax-i2m1 10602 ax-1ne0 10603 ax-1rid 10604 ax-rnegex 10605 ax-rrecex 10606 ax-cnre 10607 ax-pre-lttri 10608 ax-pre-lttrn 10609 ax-pre-ltadd 10610 ax-pre-mulgt0 10611 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-reu 3144 df-rab 3146 df-v 3495 df-sbc 3771 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4465 df-pw 4538 df-sn 4565 df-pr 4567 df-tp 4569 df-op 4571 df-uni 4836 df-int 4874 df-iun 4918 df-br 5064 df-opab 5126 df-mpt 5144 df-tr 5170 df-id 5457 df-eprel 5462 df-po 5471 df-so 5472 df-fr 5511 df-we 5513 df-xp 5558 df-rel 5559 df-cnv 5560 df-co 5561 df-dm 5562 df-rn 5563 df-res 5564 df-ima 5565 df-pred 6145 df-ord 6191 df-on 6192 df-lim 6193 df-suc 6194 df-iota 6311 df-fun 6354 df-fn 6355 df-f 6356 df-f1 6357 df-fo 6358 df-f1o 6359 df-fv 6360 df-riota 7111 df-ov 7156 df-oprab 7157 df-mpo 7158 df-om 7578 df-1st 7686 df-2nd 7687 df-wrecs 7944 df-recs 8005 df-rdg 8043 df-1o 8099 df-oadd 8103 df-er 8286 df-en 8507 df-dom 8508 df-sdom 8509 df-fin 8510 df-card 9365 df-pnf 10674 df-mnf 10675 df-xr 10676 df-ltxr 10677 df-le 10678 df-sub 10869 df-neg 10870 df-nn 11636 df-n0 11896 df-z 11980 df-uz 12242 df-fz 12891 df-fzo 13032 df-hash 13689 df-word 13860 df-concat 13919 df-s1 13946 |
This theorem is referenced by: ccat2s1fstOLD 13997 |
Copyright terms: Public domain | W3C validator |