| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cshwshashnsame | Structured version Visualization version GIF version | ||
| Description: If a word (not consisting of identical symbols) has a length being a prime number, the size of the set of (different!) words resulting by cyclically shifting the original word equals the length of the original word. (Contributed by AV, 19-May-2018.) (Revised by AV, 10-Nov-2018.) |
| Ref | Expression |
|---|---|
| cshwrepswhash1.m | ⊢ 𝑀 = {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} |
| Ref | Expression |
|---|---|
| cshwshashnsame | ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → (∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0) → (♯‘𝑀) = (♯‘𝑊))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cshwrepswhash1.m | . . . . . 6 ⊢ 𝑀 = {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} | |
| 2 | 1 | cshwsiun 17160 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → 𝑀 = ∪ 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)}) |
| 3 | 2 | ad2antrr 738 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → 𝑀 = ∪ 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)}) |
| 4 | 3 | fveq2d 6887 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → (♯‘𝑀) = (♯‘∪ 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)})) |
| 5 | fzofi 14012 | . . . . 5 ⊢ (0..^(♯‘𝑊)) ∈ Fin | |
| 6 | 5 | a1i 11 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → (0..^(♯‘𝑊)) ∈ Fin) |
| 7 | snfi 9041 | . . . . 5 ⊢ {(𝑊 cyclShift 𝑛)} ∈ Fin | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ 𝑛 ∈ (0..^(♯‘𝑊))) → {(𝑊 cyclShift 𝑛)} ∈ Fin) |
| 9 | id 23 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ)) | |
| 10 | 9 | cshwsdisj 17159 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → Disj 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)}) |
| 11 | 6, 8, 10 | hashiun 15876 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → (♯‘∪ 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)}) = Σ𝑛 ∈ (0..^(♯‘𝑊))(♯‘{(𝑊 cyclShift 𝑛)})) |
| 12 | ovex 7445 | . . . . . 6 ⊢ (𝑊 cyclShift 𝑛) ∈ V | |
| 13 | hashsng 14407 | . . . . . 6 ⊢ ((𝑊 cyclShift 𝑛) ∈ V → (♯‘{(𝑊 cyclShift 𝑛)}) = 1) | |
| 14 | 12, 13 | mp1i 14 | . . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → (♯‘{(𝑊 cyclShift 𝑛)}) = 1) |
| 15 | 14 | sumeq2sdv 15756 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → Σ𝑛 ∈ (0..^(♯‘𝑊))(♯‘{(𝑊 cyclShift 𝑛)}) = Σ𝑛 ∈ (0..^(♯‘𝑊))1) |
| 16 | 1cnd 11203 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → 1 ∈ ℂ) | |
| 17 | fsumconst 15843 | . . . . . . 7 ⊢ (((0..^(♯‘𝑊)) ∈ Fin ∧ 1 ∈ ℂ) → Σ𝑛 ∈ (0..^(♯‘𝑊))1 = ((♯‘(0..^(♯‘𝑊))) · 1)) | |
| 18 | 5, 16, 17 | sylancr 598 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → Σ𝑛 ∈ (0..^(♯‘𝑊))1 = ((♯‘(0..^(♯‘𝑊))) · 1)) |
| 19 | lencl 14572 | . . . . . . . . 9 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 20 | 19 | adantr 485 | . . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → (♯‘𝑊) ∈ ℕ0) |
| 21 | hashfzo0 14469 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℕ0 → (♯‘(0..^(♯‘𝑊))) = (♯‘𝑊)) | |
| 22 | 20, 21 | syl 18 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → (♯‘(0..^(♯‘𝑊))) = (♯‘𝑊)) |
| 23 | 22 | oveq1d 7427 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → ((♯‘(0..^(♯‘𝑊))) · 1) = ((♯‘𝑊) · 1)) |
| 24 | prmnn 16733 | . . . . . . . . 9 ⊢ ((♯‘𝑊) ∈ ℙ → (♯‘𝑊) ∈ ℕ) | |
| 25 | 24 | nnred 12249 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℙ → (♯‘𝑊) ∈ ℝ) |
| 26 | 25 | adantl 486 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → (♯‘𝑊) ∈ ℝ) |
| 27 | ax-1rid 11171 | . . . . . . 7 ⊢ ((♯‘𝑊) ∈ ℝ → ((♯‘𝑊) · 1) = (♯‘𝑊)) | |
| 28 | 26, 27 | syl 18 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → ((♯‘𝑊) · 1) = (♯‘𝑊)) |
| 29 | 18, 23, 28 | 3eqtrd 2802 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → Σ𝑛 ∈ (0..^(♯‘𝑊))1 = (♯‘𝑊)) |
| 30 | 29 | adantr 485 | . . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → Σ𝑛 ∈ (0..^(♯‘𝑊))1 = (♯‘𝑊)) |
| 31 | 15, 30 | eqtrd 2798 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → Σ𝑛 ∈ (0..^(♯‘𝑊))(♯‘{(𝑊 cyclShift 𝑛)}) = (♯‘𝑊)) |
| 32 | 4, 11, 31 | 3eqtrd 2802 | . 2 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → (♯‘𝑀) = (♯‘𝑊)) |
| 33 | 32 | ex 417 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ) → (∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0) → (♯‘𝑀) = (♯‘𝑊))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∃wrex 3089 {crab 3416 Vcvv 3455 {csn 4590 ∪ ciun 4957 ‘cfv 6538 (class class class)co 7412 Fincfn 8944 ℂcc 11099 ℝcr 11100 0cc0 11101 1c1 11102 · cmul 11106 ℕ0cn0 12505 ..^cfzo 13684 ♯chash 14368 Word cword 14552 cyclShift ccsh 14827 Σcsu 15739 ℙcprime 16730 |
| 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 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-inf2 9611 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| 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-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-disj 5078 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-2o 8455 df-oadd 8458 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-inf 9404 df-oi 9473 df-dju 9888 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-xnn0 12579 df-z 12593 df-uz 12864 df-rp 13018 df-fz 13537 df-fzo 13685 df-fl 13827 df-mod 13905 df-seq 14040 df-exp 14100 df-hash 14369 df-word 14553 df-concat 14610 df-substr 14681 df-pfx 14711 df-reps 14808 df-csh 14828 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-clim 15541 df-sum 15740 df-dvds 16312 df-gcd 16554 df-prm 16731 df-phi 16826 |
| This theorem is referenced by: cshwshash 17165 umgrhashecclwwlk 30410 |
| Copyright terms: Public domain | W3C validator |