cshwn - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cshwn		Structured version Visualization version GIF version

Theorem cshwn 14777

Description: A word cyclically shifted by its length is the word itself. (Contributed by AV, 16-May-2018.) (Revised by AV, 20-May-2018.) (Revised by AV, 26-Oct-2018.)

**Assertion**
Ref	Expression
cshwn	⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift (♯‘𝑊)) = 𝑊)

**Proof of Theorem cshwn**
Step	Hyp	Ref	Expression
1		0csh0 14773	. . . 4 ⊢ (∅ cyclShift (♯‘𝑊)) = ∅
2		oveq1 7421	. . . 4 ⊢ (∅ = 𝑊 → (∅ cyclShift (♯‘𝑊)) = (𝑊 cyclShift (♯‘𝑊)))
3		id 22	. . . 4 ⊢ (∅ = 𝑊 → ∅ = 𝑊)
4	1, 2, 3	3eqtr3a 2789	. . 3 ⊢ (∅ = 𝑊 → (𝑊 cyclShift (♯‘𝑊)) = 𝑊)
5	4	a1d 25	. 2 ⊢ (∅ = 𝑊 → (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift (♯‘𝑊)) = 𝑊))
6		lencl 14513	. . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ₀)
7	6	nn0zd 12612	. . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℤ)
8		cshwmodn 14775	. . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℤ) → (𝑊 cyclShift (♯‘𝑊)) = (𝑊 cyclShift ((♯‘𝑊) mod (♯‘𝑊))))
9	7, 8	mpdan 685	. . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift (♯‘𝑊)) = (𝑊 cyclShift ((♯‘𝑊) mod (♯‘𝑊))))
10	9	adantl 480	. . . 4 ⊢ ((∅ ≠ 𝑊 ∧ 𝑊 ∈ Word 𝑉) → (𝑊 cyclShift (♯‘𝑊)) = (𝑊 cyclShift ((♯‘𝑊) mod (♯‘𝑊))))
11		necom 2984	. . . . . . . . 9 ⊢ (∅ ≠ 𝑊 ↔ 𝑊 ≠ ∅)
12		lennncl 14514	. . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ)
13	11, 12	sylan2b 592	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (♯‘𝑊) ∈ ℕ)
14	13	nnrpd 13044	. . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ∅ ≠ 𝑊) → (♯‘𝑊) ∈ ℝ⁺)
15	14	ancoms 457	. . . . . 6 ⊢ ((∅ ≠ 𝑊 ∧ 𝑊 ∈ Word 𝑉) → (♯‘𝑊) ∈ ℝ⁺)
16		modid0 13892	. . . . . 6 ⊢ ((♯‘𝑊) ∈ ℝ⁺ → ((♯‘𝑊) mod (♯‘𝑊)) = 0)
17	15, 16	syl 17	. . . . 5 ⊢ ((∅ ≠ 𝑊 ∧ 𝑊 ∈ Word 𝑉) → ((♯‘𝑊) mod (♯‘𝑊)) = 0)
18	17	oveq2d 7430	. . . 4 ⊢ ((∅ ≠ 𝑊 ∧ 𝑊 ∈ Word 𝑉) → (𝑊 cyclShift ((♯‘𝑊) mod (♯‘𝑊))) = (𝑊 cyclShift 0))
19		cshw0 14774	. . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift 0) = 𝑊)
20	19	adantl 480	. . . 4 ⊢ ((∅ ≠ 𝑊 ∧ 𝑊 ∈ Word 𝑉) → (𝑊 cyclShift 0) = 𝑊)
21	10, 18, 20	3eqtrd 2769	. . 3 ⊢ ((∅ ≠ 𝑊 ∧ 𝑊 ∈ Word 𝑉) → (𝑊 cyclShift (♯‘𝑊)) = 𝑊)
22	21	ex 411	. 2 ⊢ (∅ ≠ 𝑊 → (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift (♯‘𝑊)) = 𝑊))
23	5, 22	pm2.61ine 3015	1 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 cyclShift (♯‘𝑊)) = 𝑊)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∅c0 4316 ‘cfv 6541 (class class class)co 7414 0cc0 11136 ℕcn 12240 ℤcz 12586 ℝ⁺crp 13004 mod cmo 13864 ♯chash 14319 Word cword 14494 cyclShift ccsh 14768

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5357 ax-pr 5421 ax-un 7736 ax-cnex 11192 ax-resscn 11193 ax-1cn 11194 ax-icn 11195 ax-addcl 11196 ax-addrcl 11197 ax-mulcl 11198 ax-mulrcl 11199 ax-mulcom 11200 ax-addass 11201 ax-mulass 11202 ax-distr 11203 ax-i2m1 11204 ax-1ne0 11205 ax-1rid 11206 ax-rnegex 11207 ax-rrecex 11208 ax-cnre 11209 ax-pre-lttri 11210 ax-pre-lttrn 11211 ax-pre-ltadd 11212 ax-pre-mulgt0 11213 ax-pre-sup 11214

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3958 df-nul 4317 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-int 4943 df-iun 4991 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5568 df-eprel 5574 df-po 5582 df-so 5583 df-fr 5625 df-we 5627 df-xp 5676 df-rel 5677 df-cnv 5678 df-co 5679 df-dm 5680 df-rn 5681 df-res 5682 df-ima 5683 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7867 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8388 df-rdg 8427 df-1o 8483 df-er 8721 df-en 8961 df-dom 8962 df-sdom 8963 df-fin 8964 df-sup 9463 df-inf 9464 df-card 9960 df-pnf 11278 df-mnf 11279 df-xr 11280 df-ltxr 11281 df-le 11282 df-sub 11474 df-neg 11475 df-div 11900 df-nn 12241 df-n0 12501 df-z 12587 df-uz 12851 df-rp 13005 df-fz 13515 df-fzo 13658 df-fl 13787 df-mod 13865 df-hash 14320 df-word 14495 df-concat 14551 df-substr 14621 df-pfx 14651 df-csh 14769

This theorem is referenced by: 2cshwid 14794 cshweqdif2 14799 scshwfzeqfzo 14807 cshwcshid 14808 clwwisshclwwsn 29842 eucrct2eupth 30071

W3C validator

	
		OSZAR »