Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wrdeqs1cat | Structured version Visualization version GIF version |
Description: Decompose a nonempty word by separating off the first symbol. (Contributed by Stefan O'Rear, 25-Aug-2015.) (Revised by Mario Carneiro, 1-Oct-2015.) (Proof shortened by AV, 9-May-2020.) |
Ref | Expression |
---|---|
wrdeqs1cat | ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 𝑊 = (〈“(𝑊‘0)”〉 ++ (𝑊 substr 〈1, (#‘𝑊)〉))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 473 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 𝑊 ∈ Word 𝐴) | |
2 | 1nn0 11308 | . . . 4 ⊢ 1 ∈ ℕ0 | |
3 | 0elfz 12436 | . . . 4 ⊢ (1 ∈ ℕ0 → 0 ∈ (0...1)) | |
4 | 2, 3 | mp1i 13 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 0 ∈ (0...1)) |
5 | wrdfin 13323 | . . . 4 ⊢ (𝑊 ∈ Word 𝐴 → 𝑊 ∈ Fin) | |
6 | 1elfz0hash 13179 | . . . 4 ⊢ ((𝑊 ∈ Fin ∧ 𝑊 ≠ ∅) → 1 ∈ (0...(#‘𝑊))) | |
7 | 5, 6 | sylan 488 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 1 ∈ (0...(#‘𝑊))) |
8 | lennncl 13325 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (#‘𝑊) ∈ ℕ) | |
9 | 8 | nnnn0d 11351 | . . . 4 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (#‘𝑊) ∈ ℕ0) |
10 | eluzfz2 12349 | . . . . 5 ⊢ ((#‘𝑊) ∈ (ℤ≥‘0) → (#‘𝑊) ∈ (0...(#‘𝑊))) | |
11 | nn0uz 11722 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
12 | 10, 11 | eleq2s 2719 | . . . 4 ⊢ ((#‘𝑊) ∈ ℕ0 → (#‘𝑊) ∈ (0...(#‘𝑊))) |
13 | 9, 12 | syl 17 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (#‘𝑊) ∈ (0...(#‘𝑊))) |
14 | ccatswrd 13456 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ (0 ∈ (0...1) ∧ 1 ∈ (0...(#‘𝑊)) ∧ (#‘𝑊) ∈ (0...(#‘𝑊)))) → ((𝑊 substr 〈0, 1〉) ++ (𝑊 substr 〈1, (#‘𝑊)〉)) = (𝑊 substr 〈0, (#‘𝑊)〉)) | |
15 | 1, 4, 7, 13, 14 | syl13anc 1328 | . 2 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → ((𝑊 substr 〈0, 1〉) ++ (𝑊 substr 〈1, (#‘𝑊)〉)) = (𝑊 substr 〈0, (#‘𝑊)〉)) |
16 | 0p1e1 11132 | . . . . . 6 ⊢ (0 + 1) = 1 | |
17 | 16 | opeq2i 4406 | . . . . 5 ⊢ 〈0, (0 + 1)〉 = 〈0, 1〉 |
18 | 17 | oveq2i 6661 | . . . 4 ⊢ (𝑊 substr 〈0, (0 + 1)〉) = (𝑊 substr 〈0, 1〉) |
19 | 0nn0 11307 | . . . . . . 7 ⊢ 0 ∈ ℕ0 | |
20 | 19 | a1i 11 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 0 ∈ ℕ0) |
21 | hashgt0 13177 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 0 < (#‘𝑊)) | |
22 | elfzo0 12508 | . . . . . 6 ⊢ (0 ∈ (0..^(#‘𝑊)) ↔ (0 ∈ ℕ0 ∧ (#‘𝑊) ∈ ℕ ∧ 0 < (#‘𝑊))) | |
23 | 20, 8, 21, 22 | syl3anbrc 1246 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 0 ∈ (0..^(#‘𝑊))) |
24 | swrds1 13451 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 0 ∈ (0..^(#‘𝑊))) → (𝑊 substr 〈0, (0 + 1)〉) = 〈“(𝑊‘0)”〉) | |
25 | 23, 24 | syldan 487 | . . . 4 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈0, (0 + 1)〉) = 〈“(𝑊‘0)”〉) |
26 | 18, 25 | syl5eqr 2670 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈0, 1〉) = 〈“(𝑊‘0)”〉) |
27 | 26 | oveq1d 6665 | . 2 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → ((𝑊 substr 〈0, 1〉) ++ (𝑊 substr 〈1, (#‘𝑊)〉)) = (〈“(𝑊‘0)”〉 ++ (𝑊 substr 〈1, (#‘𝑊)〉))) |
28 | swrdid 13428 | . . 3 ⊢ (𝑊 ∈ Word 𝐴 → (𝑊 substr 〈0, (#‘𝑊)〉) = 𝑊) | |
29 | 28 | adantr 481 | . 2 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (𝑊 substr 〈0, (#‘𝑊)〉) = 𝑊) |
30 | 15, 27, 29 | 3eqtr3rd 2665 | 1 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 𝑊 = (〈“(𝑊‘0)”〉 ++ (𝑊 substr 〈1, (#‘𝑊)〉))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∅c0 3915 〈cop 4183 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 Fincfn 7955 0cc0 9936 1c1 9937 + caddc 9939 < clt 10074 ℕcn 11020 ℕ0cn0 11292 ℤ≥cuz 11687 ...cfz 12326 ..^cfzo 12465 #chash 13117 Word cword 13291 ++ cconcat 13293 〈“cs1 13294 substr csubstr 13295 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-xnn0 11364 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-concat 13301 df-s1 13302 df-substr 13303 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |