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 14506 | . . . 4 ⊢ (∅ cyclShift 0) = ∅ | |
2 | oveq1 7282 | . . . 4 ⊢ (∅ = 𝑊 → (∅ cyclShift 0) = (𝑊 cyclShift 0)) | |
3 | id 22 | . . . 4 ⊢ (∅ = 𝑊 → ∅ = 𝑊) | |
4 | 1, 2, 3 | 3eqtr3a 2802 | . . 3 ⊢ (∅ = 𝑊 → (𝑊 cyclShift 0) = 𝑊) |
5 | 4 | a1d 25 | . 2 ⊢ (∅ = 𝑊 → (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊)) |
6 | 0z 12330 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
7 | cshword 14504 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 0 ∈ ℤ) → (𝑊 cyclShift 0) = ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊))))) | |
8 | 6, 7 | mpan2 688 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊))))) |
9 | 8 | adantr 481 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 cyclShift 0) = ((𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) ++ (𝑊 prefix (0 mod (♯‘𝑊))))) |
10 | necom 2997 | . . . . . 6 ⊢ (∅ ≠ 𝑊 ↔ 𝑊 ≠ ∅) | |
11 | lennncl 14237 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ) | |
12 | nnrp 12741 | . . . . . . 7 ⊢ ((♯‘𝑊) ∈ ℕ → (♯‘𝑊) ∈ ℝ+) | |
13 | 0mod 13622 | . . . . . . . . . 10 ⊢ ((♯‘𝑊) ∈ ℝ+ → (0 mod (♯‘𝑊)) = 0) | |
14 | 13 | opeq1d 4810 | . . . . . . . . 9 ⊢ ((♯‘𝑊) ∈ ℝ+ → 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉 = 〈0, (♯‘𝑊)〉) |
15 | 14 | oveq2d 7291 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℝ+ → (𝑊 substr 〈(0 mod (♯‘𝑊)), (♯‘𝑊)〉) = (𝑊 substr 〈0, (♯‘𝑊)〉)) |
16 | 13 | oveq2d 7291 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℝ+ → (𝑊 prefix (0 mod (♯‘𝑊))) = (𝑊 prefix 0)) |
17 | 15, 16 | oveq12d 7293 | . . . . . . 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 594 | . . . . 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 14236 | . . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
22 | pfxval 14386 | . . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℕ0) → (𝑊 prefix (♯‘𝑊)) = (𝑊 substr 〈0, (♯‘𝑊)〉)) | |
23 | 21, 22 | mpdan 684 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 prefix (♯‘𝑊)) = (𝑊 substr 〈0, (♯‘𝑊)〉)) |
24 | pfxid 14397 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 prefix (♯‘𝑊)) = 𝑊) | |
25 | 23, 24 | eqtr3d 2780 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 substr 〈0, (♯‘𝑊)〉) = 𝑊) |
26 | 25 | adantr 481 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 substr 〈0, (♯‘𝑊)〉) = 𝑊) |
27 | pfx00 14387 | . . . . . 6 ⊢ (𝑊 prefix 0) = ∅ | |
28 | 27 | a1i 11 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 prefix 0) = ∅) |
29 | 26, 28 | oveq12d 7293 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → ((𝑊 substr 〈0, (♯‘𝑊)〉) ++ (𝑊 prefix 0)) = (𝑊 ++ ∅)) |
30 | ccatrid 14292 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ++ ∅) = 𝑊) | |
31 | 30 | adantr 481 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 ++ ∅) = 𝑊) |
32 | 20, 29, 31 | 3eqtrd 2782 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (𝑊 cyclShift 0) = 𝑊) |
33 | 32 | expcom 414 | . 2 ⊢ (∅ ≠ 𝑊 → (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊)) |
34 | 5, 33 | pm2.61ine 3028 | 1 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∅c0 4256 〈cop 4567 ‘cfv 6433 (class class class)co 7275 0cc0 10871 ℕcn 11973 ℕ0cn0 12233 ℤcz 12319 ℝ+crp 12730 mod cmo 13589 ♯chash 14044 Word cword 14217 ++ cconcat 14273 substr csubstr 14353 prefix cpfx 14383 cyclShift ccsh 14501 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-sup 9201 df-inf 9202 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-fz 13240 df-fzo 13383 df-fl 13512 df-mod 13590 df-hash 14045 df-word 14218 df-concat 14274 df-substr 14354 df-pfx 14384 df-csh 14502 |
This theorem is referenced by: cshwn 14510 2cshwcshw 14538 scshwfzeqfzo 14539 cshwrepswhash1 16804 crctcshlem4 28185 clwwisshclwws 28379 erclwwlkref 28384 erclwwlknref 28433 1cshid 31231 |
Copyright terms: Public domain | W3C validator |