Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cshw0 | Structured version Visualization version GIF version |
Description: A word cyclically shifted by 0 is the word itself. (Contributed by AV, 16-May-2018.) (Revised by AV, 20-May-2018.) (Revised by AV, 26-Oct-2018.) |
Ref | Expression |
---|---|
cshw0 | ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0csh0 14434 | . . . 4 ⊢ (∅ cyclShift 0) = ∅ | |
2 | oveq1 7262 | . . . 4 ⊢ (∅ = 𝑊 → (∅ cyclShift 0) = (𝑊 cyclShift 0)) | |
3 | id 22 | . . . 4 ⊢ (∅ = 𝑊 → ∅ = 𝑊) | |
4 | 1, 2, 3 | 3eqtr3a 2803 | . . 3 ⊢ (∅ = 𝑊 → (𝑊 cyclShift 0) = 𝑊) |
5 | 4 | a1d 25 | . 2 ⊢ (∅ = 𝑊 → (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊)) |
6 | 0z 12260 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
7 | cshword 14432 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 0 ∈ ℤ) → (𝑊 cyclShift 0) = ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊))))) | |
8 | 6, 7 | mpan2 687 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊))))) |
9 | 8 | adantr 480 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 cyclShift 0) = ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊))))) |
10 | necom 2996 | . . . . . 6 ⊢ (∅ ≠ 𝑊 ↔ 𝑊 ≠ ∅) | |
11 | lennncl 14165 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ) | |
12 | nnrp 12670 | . . . . . . 7 ⊢ ((♯‘𝑊) ∈ ℕ → (♯‘𝑊) ∈ ℝ+) | |
13 | 0mod 13550 | . . . . . . . . . 10 ⊢ ((♯‘𝑊) ∈ ℝ+ → (0 mod (♯‘𝑊)) = 0) | |
14 | 13 | opeq1d 4807 | . . . . . . . . 9 ⊢ ((♯‘𝑊) ∈ ℝ+ → 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉 = 〈0, (♯‘𝑊)〉) |
15 | 14 | oveq2d 7271 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℝ+ → (𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) = (𝑊 substr 〈0, (♯‘𝑊)〉)) |
16 | 13 | oveq2d 7271 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℝ+ → (𝑊 prefix (0 mod (♯‘𝑊))) = (𝑊 prefix 0)) |
17 | 15, 16 | oveq12d 7273 | . . . . . . 7 ⊢ ((♯‘𝑊) ∈ ℝ+ → ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊)))) = ((𝑊 substr 〈0, (♯‘𝑊)〉) ++ (𝑊 prefix 0))) |
18 | 11, 12, 17 | 3syl 18 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊)))) = ((𝑊 substr 〈0, (♯‘𝑊)〉) ++ (𝑊 prefix 0))) |
19 | 10, 18 | sylan2b 593 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊)))) = ((𝑊 substr 〈0, (♯‘𝑊)〉) ++ (𝑊 prefix 0))) |
20 | 9, 19 | eqtrd 2778 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 cyclShift 0) = ((𝑊 substr 〈0, (♯‘𝑊)〉) ++ (𝑊 prefix 0))) |
21 | lencl 14164 | . . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
22 | pfxval 14314 | . . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℕ0) → (𝑊 prefix (♯‘𝑊)) = (𝑊 substr 〈0, (♯‘𝑊)〉)) | |
23 | 21, 22 | mpdan 683 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 prefix (♯‘𝑊)) = (𝑊 substr 〈0, (♯‘𝑊)〉)) |
24 | pfxid 14325 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 prefix (♯‘𝑊)) = 𝑊) | |
25 | 23, 24 | eqtr3d 2780 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 substr 〈0, (♯‘𝑊)〉) = 𝑊) |
26 | 25 | adantr 480 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 substr 〈0, (♯‘𝑊)〉) = 𝑊) |
27 | pfx00 14315 | . . . . . 6 ⊢ (𝑊 prefix 0) = ∅ | |
28 | 27 | a1i 11 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 prefix 0) = ∅) |
29 | 26, 28 | oveq12d 7273 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → ((𝑊 substr 〈0, (♯‘𝑊)〉) ++ (𝑊 prefix 0)) = (𝑊 ++ ∅)) |
30 | ccatrid 14220 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ++ ∅) = 𝑊) | |
31 | 30 | adantr 480 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 ++ ∅) = 𝑊) |
32 | 20, 29, 31 | 3eqtrd 2782 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 cyclShift 0) = 𝑊) |
33 | 32 | expcom 413 | . 2 ⊢ (∅ ≠ 𝑊 → (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊)) |
34 | 5, 33 | pm2.61ine 3027 | 1 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∅c0 4253 〈cop 4564 ‘cfv 6418 (class class class)co 7255 0cc0 10802 ℕcn 11903 ℕ0cn0 12163 ℤcz 12249 ℝ+crp 12659 mod cmo 13517 ♯chash 13972 Word cword 14145 ++ cconcat 14201 substr csubstr 14281 prefix cpfx 14311 cyclShift ccsh 14429 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-inf 9132 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fz 13169 df-fzo 13312 df-fl 13440 df-mod 13518 df-hash 13973 df-word 14146 df-concat 14202 df-substr 14282 df-pfx 14312 df-csh 14430 |
This theorem is referenced by: cshwn 14438 2cshwcshw 14466 scshwfzeqfzo 14467 cshwrepswhash1 16732 crctcshlem4 28086 clwwisshclwws 28280 erclwwlkref 28285 erclwwlknref 28334 1cshid 31133 |
Copyright terms: Public domain | W3C validator |