repswcshw - Metamath Proof Explorer

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

Theorem repswcshw 13409

Description: A cyclically shifted "repeated symbol word". (Contributed by Alexander van der Vekens, 7-Nov-2018.)

**Assertion**
Ref	Expression
repswcshw	⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = (𝑆 repeatS 𝑁))

**Proof of Theorem repswcshw**
Step	Hyp	Ref	Expression
1		0csh0 13390	. . . . 5 ⊢ (∅ cyclShift 𝐼) = ∅
2		repsw0 13375	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → (𝑆 repeatS 0) = ∅)
3	2	oveq1d 6564	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → ((𝑆 repeatS 0) cyclShift 𝐼) = (∅ cyclShift 𝐼))
4	1, 3, 2	3eqtr4a 2670	. . . 4 ⊢ (𝑆 ∈ 𝑉 → ((𝑆 repeatS 0) cyclShift 𝐼) = (𝑆 repeatS 0))
5	4	3ad2ant1 1075	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 0) cyclShift 𝐼) = (𝑆 repeatS 0))
6		oveq2 6557	. . . . 5 ⊢ (𝑁 = 0 → (𝑆 repeatS 𝑁) = (𝑆 repeatS 0))
7	6	oveq1d 6564	. . . 4 ⊢ (𝑁 = 0 → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = ((𝑆 repeatS 0) cyclShift 𝐼))
8	7, 6	eqeq12d 2625	. . 3 ⊢ (𝑁 = 0 → (((𝑆 repeatS 𝑁) cyclShift 𝐼) = (𝑆 repeatS 𝑁) ↔ ((𝑆 repeatS 0) cyclShift 𝐼) = (𝑆 repeatS 0)))
9	5, 8	syl5ibr 235	. 2 ⊢ (𝑁 = 0 → ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = (𝑆 repeatS 𝑁)))
10		idd 24	. . . 4 ⊢ (¬ 𝑁 = 0 → (𝑆 ∈ 𝑉 → 𝑆 ∈ 𝑉))
11		df-ne 2782	. . . . 5 ⊢ (𝑁 ≠ 0 ↔ ¬ 𝑁 = 0)
12		elnnne0 11183	. . . . . 6 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ₀ ∧ 𝑁 ≠ 0))
13	12	simplbi2com 655	. . . . 5 ⊢ (𝑁 ≠ 0 → (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℕ))
14	11, 13	sylbir 224	. . . 4 ⊢ (¬ 𝑁 = 0 → (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℕ))
15		idd 24	. . . 4 ⊢ (¬ 𝑁 = 0 → (𝐼 ∈ ℤ → 𝐼 ∈ ℤ))
16	10, 14, 15	3anim123d 1398	. . 3 ⊢ (¬ 𝑁 = 0 → ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀ ∧ 𝐼 ∈ ℤ) → (𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ)))
17		nnnn0 11176	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
18	17	anim2i 591	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀))
19		repsw 13373	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀) → (𝑆 repeatS 𝑁) ∈ Word 𝑉)
20	18, 19	syl 17	. . . . 5 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑆 repeatS 𝑁) ∈ Word 𝑉)
21		cshword 13388	. . . . 5 ⊢ (((𝑆 repeatS 𝑁) ∈ Word 𝑉 ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod (#‘(𝑆 repeatS 𝑁))), (#‘(𝑆 repeatS 𝑁))⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod (#‘(𝑆 repeatS 𝑁)))⟩)))
22	20, 21	stoic3 1692	. . . 4 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod (#‘(𝑆 repeatS 𝑁))), (#‘(𝑆 repeatS 𝑁))⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod (#‘(𝑆 repeatS 𝑁)))⟩)))
23		repswlen 13374	. . . . . . . . . 10 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀) → (#‘(𝑆 repeatS 𝑁)) = 𝑁)
24	18, 23	syl 17	. . . . . . . . 9 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (#‘(𝑆 repeatS 𝑁)) = 𝑁)
25	24	oveq2d 6565	. . . . . . . 8 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝐼 mod (#‘(𝑆 repeatS 𝑁))) = (𝐼 mod 𝑁))
26	25, 24	opeq12d 4348	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ⟨(𝐼 mod (#‘(𝑆 repeatS 𝑁))), (#‘(𝑆 repeatS 𝑁))⟩ = ⟨(𝐼 mod 𝑁), 𝑁⟩)
27	26	oveq2d 6565	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod (#‘(𝑆 repeatS 𝑁))), (#‘(𝑆 repeatS 𝑁))⟩) = ((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod 𝑁), 𝑁⟩))
28	25	opeq2d 4347	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ⟨0, (𝐼 mod (#‘(𝑆 repeatS 𝑁)))⟩ = ⟨0, (𝐼 mod 𝑁)⟩)
29	28	oveq2d 6565	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod (#‘(𝑆 repeatS 𝑁)))⟩) = ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod 𝑁)⟩))
30	27, 29	oveq12d 6567	. . . . 5 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod (#‘(𝑆 repeatS 𝑁))), (#‘(𝑆 repeatS 𝑁))⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod (#‘(𝑆 repeatS 𝑁)))⟩)) = (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod 𝑁), 𝑁⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod 𝑁)⟩)))
31	30	3adant3 1074	. . . 4 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod (#‘(𝑆 repeatS 𝑁))), (#‘(𝑆 repeatS 𝑁))⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod (#‘(𝑆 repeatS 𝑁)))⟩)) = (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod 𝑁), 𝑁⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod 𝑁)⟩)))
32	18	3adant3 1074	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀))
33		zmodcl 12552	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝐼 mod 𝑁) ∈ ℕ₀)
34	33	ancoms 468	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ∈ ℕ₀)
35	17	adantr 480	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → 𝑁 ∈ ℕ₀)
36	34, 35	jca 553	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝐼 mod 𝑁) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀))
37	36	3adant1 1072	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝐼 mod 𝑁) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀))
38		nnre 10904	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ)
39	38	leidd 10473	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 𝑁 ≤ 𝑁)
40	39	3ad2ant2 1076	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → 𝑁 ≤ 𝑁)
41		repswswrd 13382	. . . . . . 7 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀) ∧ ((𝐼 mod 𝑁) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑁) → ((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod 𝑁), 𝑁⟩) = (𝑆 repeatS (𝑁 − (𝐼 mod 𝑁))))
42	32, 37, 40, 41	syl3anc 1318	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod 𝑁), 𝑁⟩) = (𝑆 repeatS (𝑁 − (𝐼 mod 𝑁))))
43		0nn0 11184	. . . . . . . . 9 ⊢ 0 ∈ ℕ₀
44	34, 43	jctil 558	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (0 ∈ ℕ₀ ∧ (𝐼 mod 𝑁) ∈ ℕ₀))
45	44	3adant1 1072	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (0 ∈ ℕ₀ ∧ (𝐼 mod 𝑁) ∈ ℕ₀))
46		zre 11258	. . . . . . . . . 10 ⊢ (𝐼 ∈ ℤ → 𝐼 ∈ ℝ)
47		nnrp 11718	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ⁺)
48		modcl 12534	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ⁺) → (𝐼 mod 𝑁) ∈ ℝ)
49	46, 47, 48	syl2anr 494	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ∈ ℝ)
50	38	adantr 480	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → 𝑁 ∈ ℝ)
51		modlt 12541	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ⁺) → (𝐼 mod 𝑁) < 𝑁)
52	46, 47, 51	syl2anr 494	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) < 𝑁)
53	49, 50, 52	ltled 10064	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ≤ 𝑁)
54	53	3adant1 1072	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ≤ 𝑁)
55		repswswrd 13382	. . . . . . 7 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀) ∧ (0 ∈ ℕ₀ ∧ (𝐼 mod 𝑁) ∈ ℕ₀) ∧ (𝐼 mod 𝑁) ≤ 𝑁) → ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod 𝑁)⟩) = (𝑆 repeatS ((𝐼 mod 𝑁) − 0)))
56	32, 45, 54, 55	syl3anc 1318	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod 𝑁)⟩) = (𝑆 repeatS ((𝐼 mod 𝑁) − 0)))
57	42, 56	oveq12d 6567	. . . . 5 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod 𝑁), 𝑁⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod 𝑁)⟩)) = ((𝑆 repeatS (𝑁 − (𝐼 mod 𝑁))) ++ (𝑆 repeatS ((𝐼 mod 𝑁) − 0))))
58		simp1 1054	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → 𝑆 ∈ 𝑉)
59	33	nn0red 11229	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝐼 mod 𝑁) ∈ ℝ)
60	59	ancoms 468	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ∈ ℝ)
61	60, 50, 52	ltled 10064	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ≤ 𝑁)
62	61	3adant1 1072	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ≤ 𝑁)
63	34	3adant1 1072	. . . . . . . 8 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝐼 mod 𝑁) ∈ ℕ₀)
64	17	3ad2ant2 1076	. . . . . . . 8 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → 𝑁 ∈ ℕ₀)
65		nn0sub 11220	. . . . . . . 8 ⊢ (((𝐼 mod 𝑁) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝐼 mod 𝑁) ≤ 𝑁 ↔ (𝑁 − (𝐼 mod 𝑁)) ∈ ℕ₀))
66	63, 64, 65	syl2anc 691	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝐼 mod 𝑁) ≤ 𝑁 ↔ (𝑁 − (𝐼 mod 𝑁)) ∈ ℕ₀))
67	62, 66	mpbid 221	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝑁 − (𝐼 mod 𝑁)) ∈ ℕ₀)
68	33	nn0ge0d 11231	. . . . . . . . 9 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 0 ≤ (𝐼 mod 𝑁))
69	68	ancoms 468	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → 0 ≤ (𝐼 mod 𝑁))
70	69	3adant1 1072	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → 0 ≤ (𝐼 mod 𝑁))
71	63, 43	jctil 558	. . . . . . . 8 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (0 ∈ ℕ₀ ∧ (𝐼 mod 𝑁) ∈ ℕ₀))
72		nn0sub 11220	. . . . . . . 8 ⊢ ((0 ∈ ℕ₀ ∧ (𝐼 mod 𝑁) ∈ ℕ₀) → (0 ≤ (𝐼 mod 𝑁) ↔ ((𝐼 mod 𝑁) − 0) ∈ ℕ₀))
73	71, 72	syl 17	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (0 ≤ (𝐼 mod 𝑁) ↔ ((𝐼 mod 𝑁) − 0) ∈ ℕ₀))
74	70, 73	mpbid 221	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝐼 mod 𝑁) − 0) ∈ ℕ₀)
75		repswccat 13383	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑁 − (𝐼 mod 𝑁)) ∈ ℕ₀ ∧ ((𝐼 mod 𝑁) − 0) ∈ ℕ₀) → ((𝑆 repeatS (𝑁 − (𝐼 mod 𝑁))) ++ (𝑆 repeatS ((𝐼 mod 𝑁) − 0))) = (𝑆 repeatS ((𝑁 − (𝐼 mod 𝑁)) + ((𝐼 mod 𝑁) − 0))))
76	58, 67, 74, 75	syl3anc 1318	. . . . 5 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS (𝑁 − (𝐼 mod 𝑁))) ++ (𝑆 repeatS ((𝐼 mod 𝑁) − 0))) = (𝑆 repeatS ((𝑁 − (𝐼 mod 𝑁)) + ((𝐼 mod 𝑁) − 0))))
77		nncn 10905	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
78	77	adantl 481	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℂ)
79	33	nn0cnd 11230	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝐼 mod 𝑁) ∈ ℂ)
80		0cnd 9912	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 0 ∈ ℂ)
81	78, 79, 80	npncand 10295	. . . . . . . . 9 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → ((𝑁 − (𝐼 mod 𝑁)) + ((𝐼 mod 𝑁) − 0)) = (𝑁 − 0))
82	77	subid1d 10260	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (𝑁 − 0) = 𝑁)
83	82	adantl 481	. . . . . . . . 9 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑁 − 0) = 𝑁)
84	81, 83	eqtrd 2644	. . . . . . . 8 ⊢ ((𝐼 ∈ ℤ ∧ 𝑁 ∈ ℕ) → ((𝑁 − (𝐼 mod 𝑁)) + ((𝐼 mod 𝑁) − 0)) = 𝑁)
85	84	ancoms 468	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝑁 − (𝐼 mod 𝑁)) + ((𝐼 mod 𝑁) − 0)) = 𝑁)
86	85	3adant1 1072	. . . . . 6 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝑁 − (𝐼 mod 𝑁)) + ((𝐼 mod 𝑁) − 0)) = 𝑁)
87	86	oveq2d 6565	. . . . 5 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (𝑆 repeatS ((𝑁 − (𝐼 mod 𝑁)) + ((𝐼 mod 𝑁) − 0))) = (𝑆 repeatS 𝑁))
88	57, 76, 87	3eqtrd 2648	. . . 4 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → (((𝑆 repeatS 𝑁) substr ⟨(𝐼 mod 𝑁), 𝑁⟩) ++ ((𝑆 repeatS 𝑁) substr ⟨0, (𝐼 mod 𝑁)⟩)) = (𝑆 repeatS 𝑁))
89	22, 31, 88	3eqtrd 2648	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = (𝑆 repeatS 𝑁))
90	16, 89	syl6 34	. 2 ⊢ (¬ 𝑁 = 0 → ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = (𝑆 repeatS 𝑁)))
91	9, 90	pm2.61i 175	1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀ ∧ 𝐼 ∈ ℤ) → ((𝑆 repeatS 𝑁) cyclShift 𝐼) = (𝑆 repeatS 𝑁))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∅c0 3874 ⟨cop 4131 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 + caddc 9818 < clt 9953 ≤ cle 9954 − cmin 10145 ℕcn 10897 ℕ₀cn0 11169 ℤcz 11254 ℝ⁺crp 11708 mod cmo 12530 #chash 12979 Word cword 13146 ++ cconcat 13148 substr csubstr 13150 repeatS creps 13153 cyclShift ccsh 13385

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-fl 12455 df-mod 12531 df-hash 12980 df-word 13154 df-concat 13156 df-substr 13158 df-reps 13161 df-csh 13386

This theorem is referenced by: cshwrepswhash1 15647

W3C validator