cshwlen - Metamath Proof Explorer

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

Theorem cshwlen 13754

Description: The length of a cyclically shifted word is the same as the length of the original word. (Contributed by AV, 16-May-2018.) (Revised by AV, 20-May-2018.) (Revised by AV, 27-Oct-2018.)

**Assertion**
Ref	Expression
cshwlen	⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘𝑊))

**Proof of Theorem cshwlen**
Step	Hyp	Ref	Expression
1		oveq1 6803	. . . . 5 ⊢ (𝑊 = ∅ → (𝑊 cyclShift 𝑁) = (∅ cyclShift 𝑁))
2		0csh0 13748	. . . . . 6 ⊢ (∅ cyclShift 𝑁) = ∅
3	2	a1i 11	. . . . 5 ⊢ (𝑊 = ∅ → (∅ cyclShift 𝑁) = ∅)
4		eqcom 2778	. . . . . 6 ⊢ (𝑊 = ∅ ↔ ∅ = 𝑊)
5	4	biimpi 206	. . . . 5 ⊢ (𝑊 = ∅ → ∅ = 𝑊)
6	1, 3, 5	3eqtrd 2809	. . . 4 ⊢ (𝑊 = ∅ → (𝑊 cyclShift 𝑁) = 𝑊)
7	6	fveq2d 6337	. . 3 ⊢ (𝑊 = ∅ → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘𝑊))
8	7	a1d 25	. 2 ⊢ (𝑊 = ∅ → ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘𝑊)))
9		cshword 13746	. . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) → (𝑊 cyclShift 𝑁) = ((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ++ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩)))
10	9	fveq2d 6337	. . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ++ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))))
11	10	adantr 466	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) ∧ 𝑊 ≠ ∅) → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ++ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))))
12		swrdcl 13627	. . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ∈ Word 𝑉)
13		swrdcl 13627	. . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩) ∈ Word 𝑉)
14		ccatlen 13557	. . . . . . 7 ⊢ (((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ∈ Word 𝑉 ∧ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩) ∈ Word 𝑉) → (♯‘((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ++ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))) = ((♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) + (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))))
15	12, 13, 14	syl2anc 573	. . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ++ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))) = ((♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) + (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))))
16	15	adantr 466	. . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) → (♯‘((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ++ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))) = ((♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) + (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))))
17	16	adantr 466	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) ∧ 𝑊 ≠ ∅) → (♯‘((𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩) ++ (𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))) = ((♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) + (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))))
18		lennncl 13521	. . . . . . . . . 10 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ)
19		pm3.21 457	. . . . . . . . . . 11 ⊢ (((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑊 ∈ Word 𝑉 → (𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ))))
20	19	ex 397	. . . . . . . . . 10 ⊢ ((♯‘𝑊) ∈ ℕ → (𝑁 ∈ ℤ → (𝑊 ∈ Word 𝑉 → (𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)))))
21	18, 20	syl 17	. . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅) → (𝑁 ∈ ℤ → (𝑊 ∈ Word 𝑉 → (𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)))))
22	21	ex 397	. . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ≠ ∅ → (𝑁 ∈ ℤ → (𝑊 ∈ Word 𝑉 → (𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ))))))
23	22	com24 95	. . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 ∈ Word 𝑉 → (𝑁 ∈ ℤ → (𝑊 ≠ ∅ → (𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ))))))
24	23	pm2.43i 52	. . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (𝑁 ∈ ℤ → (𝑊 ≠ ∅ → (𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)))))
25	24	imp31 404	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) ∧ 𝑊 ≠ ∅) → (𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)))
26		simpl 468	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → 𝑊 ∈ Word 𝑉)
27		pm3.22 447	. . . . . . . . . 10 ⊢ (((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ ℤ ∧ (♯‘𝑊) ∈ ℕ))
28	27	adantl 467	. . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (𝑁 ∈ ℤ ∧ (♯‘𝑊) ∈ ℕ))
29		zmodfzp1 12902	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ (♯‘𝑊) ∈ ℕ) → (𝑁 mod (♯‘𝑊)) ∈ (0...(♯‘𝑊)))
30	28, 29	syl 17	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (𝑁 mod (♯‘𝑊)) ∈ (0...(♯‘𝑊)))
31		lencl 13520	. . . . . . . . . 10 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ₀)
32		nn0fz0 12645	. . . . . . . . . 10 ⊢ ((♯‘𝑊) ∈ ℕ₀ ↔ (♯‘𝑊) ∈ (0...(♯‘𝑊)))
33	31, 32	sylib 208	. . . . . . . . 9 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ (0...(♯‘𝑊)))
34	33	adantr 466	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (♯‘𝑊) ∈ (0...(♯‘𝑊)))
35		swrdlen 13631	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (𝑁 mod (♯‘𝑊)) ∈ (0...(♯‘𝑊)) ∧ (♯‘𝑊) ∈ (0...(♯‘𝑊))) → (♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) = ((♯‘𝑊) − (𝑁 mod (♯‘𝑊))))
36	26, 30, 34, 35	syl3anc 1476	. . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) = ((♯‘𝑊) − (𝑁 mod (♯‘𝑊))))
37		zmodcl 12898	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ (♯‘𝑊) ∈ ℕ) → (𝑁 mod (♯‘𝑊)) ∈ ℕ₀)
38	37	ancoms 446	. . . . . . . . . 10 ⊢ (((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 mod (♯‘𝑊)) ∈ ℕ₀)
39	38	adantl 467	. . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (𝑁 mod (♯‘𝑊)) ∈ ℕ₀)
40		0elfz 12644	. . . . . . . . 9 ⊢ ((𝑁 mod (♯‘𝑊)) ∈ ℕ₀ → 0 ∈ (0...(𝑁 mod (♯‘𝑊))))
41	39, 40	syl 17	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → 0 ∈ (0...(𝑁 mod (♯‘𝑊))))
42		swrdlen 13631	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 0 ∈ (0...(𝑁 mod (♯‘𝑊))) ∧ (𝑁 mod (♯‘𝑊)) ∈ (0...(♯‘𝑊))) → (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩)) = ((𝑁 mod (♯‘𝑊)) − 0))
43	26, 41, 30, 42	syl3anc 1476	. . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩)) = ((𝑁 mod (♯‘𝑊)) − 0))
44	36, 43	oveq12d 6814	. . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → ((♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) + (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))) = (((♯‘𝑊) − (𝑁 mod (♯‘𝑊))) + ((𝑁 mod (♯‘𝑊)) − 0)))
45	37	nn0cnd 11560	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ (♯‘𝑊) ∈ ℕ) → (𝑁 mod (♯‘𝑊)) ∈ ℂ)
46	45	ancoms 446	. . . . . . . . 9 ⊢ (((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 mod (♯‘𝑊)) ∈ ℂ)
47	46	adantl 467	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (𝑁 mod (♯‘𝑊)) ∈ ℂ)
48	47	subid1d 10587	. . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → ((𝑁 mod (♯‘𝑊)) − 0) = (𝑁 mod (♯‘𝑊)))
49	48	oveq2d 6812	. . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (((♯‘𝑊) − (𝑁 mod (♯‘𝑊))) + ((𝑁 mod (♯‘𝑊)) − 0)) = (((♯‘𝑊) − (𝑁 mod (♯‘𝑊))) + (𝑁 mod (♯‘𝑊))))
50	31	nn0cnd 11560	. . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℂ)
51		npcan 10496	. . . . . . 7 ⊢ (((♯‘𝑊) ∈ ℂ ∧ (𝑁 mod (♯‘𝑊)) ∈ ℂ) → (((♯‘𝑊) − (𝑁 mod (♯‘𝑊))) + (𝑁 mod (♯‘𝑊))) = (♯‘𝑊))
52	50, 46, 51	syl2an 583	. . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → (((♯‘𝑊) − (𝑁 mod (♯‘𝑊))) + (𝑁 mod (♯‘𝑊))) = (♯‘𝑊))
53	44, 49, 52	3eqtrd 2809	. . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ((♯‘𝑊) ∈ ℕ ∧ 𝑁 ∈ ℤ)) → ((♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) + (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))) = (♯‘𝑊))
54	25, 53	syl 17	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) ∧ 𝑊 ≠ ∅) → ((♯‘(𝑊 substr ⟨(𝑁 mod (♯‘𝑊)), (♯‘𝑊)⟩)) + (♯‘(𝑊 substr ⟨0, (𝑁 mod (♯‘𝑊))⟩))) = (♯‘𝑊))
55	11, 17, 54	3eqtrd 2809	. . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) ∧ 𝑊 ≠ ∅) → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘𝑊))
56	55	expcom 398	. 2 ⊢ (𝑊 ≠ ∅ → ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘𝑊)))
57	8, 56	pm2.61ine 3026	1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑁)) = (♯‘𝑊))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 382 = wceq 1631 ∈ wcel 2145 ≠ wne 2943 ∅c0 4063 ⟨cop 4323 ‘cfv 6030 (class class class)co 6796 ℂcc 10140 0cc0 10142 + caddc 10145 − cmin 10472 ℕcn 11226 ℕ₀cn0 11499 ℤcz 11584 ...cfz 12533 mod cmo 12876 ♯chash 13321 Word cword 13487 ++ cconcat 13489 substr csubstr 13491 cyclShift ccsh 13743

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4905 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 ax-cnex 10198 ax-resscn 10199 ax-1cn 10200 ax-icn 10201 ax-addcl 10202 ax-addrcl 10203 ax-mulcl 10204 ax-mulrcl 10205 ax-mulcom 10206 ax-addass 10207 ax-mulass 10208 ax-distr 10209 ax-i2m1 10210 ax-1ne0 10211 ax-1rid 10212 ax-rnegex 10213 ax-rrecex 10214 ax-cnre 10215 ax-pre-lttri 10216 ax-pre-lttrn 10217 ax-pre-ltadd 10218 ax-pre-mulgt0 10219 ax-pre-sup 10220

This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4576 df-int 4613 df-iun 4657 df-br 4788 df-opab 4848 df-mpt 4865 df-tr 4888 df-id 5158 df-eprel 5163 df-po 5171 df-so 5172 df-fr 5209 df-we 5211 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-pred 5822 df-ord 5868 df-on 5869 df-lim 5870 df-suc 5871 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-riota 6757 df-ov 6799 df-oprab 6800 df-mpt2 6801 df-om 7217 df-1st 7319 df-2nd 7320 df-wrecs 7563 df-recs 7625 df-rdg 7663 df-1o 7717 df-oadd 7721 df-er 7900 df-en 8114 df-dom 8115 df-sdom 8116 df-fin 8117 df-sup 8508 df-inf 8509 df-card 8969 df-pnf 10282 df-mnf 10283 df-xr 10284 df-ltxr 10285 df-le 10286 df-sub 10474 df-neg 10475 df-div 10891 df-nn 11227 df-n0 11500 df-z 11585 df-uz 11894 df-rp 12036 df-fz 12534 df-fzo 12674 df-fl 12801 df-mod 12877 df-hash 13322 df-word 13495 df-concat 13497 df-substr 13499 df-csh 13744

This theorem is referenced by: cshwf 13755 2cshw 13768 lswcshw 13770 cshwleneq 13772 crctcshlem2 26946 clwwisshclwwslem 27164 clwwisshclwws 27165 erclwwlkeqlen 27169 clwwnisshclwwsn 27217 erclwwlkneqlen 27226 eucrct2eupth 27425

W3C validator