Theorem cshwcshid 14780

Description: A cyclically shifted word can be reconstructed by cyclically shifting it again. Lemma for erclwwlksym 29312 and erclwwlknsym 29361. (Contributed by AV, 8-Apr-2018.) (Revised by AV, 11-Jun-2018.) (Proof shortened by AV, 3-Nov-2018.)

Hypotheses

Ref	Expression
cshwcshid.1	⊢ (𝜑 → 𝑦 ∈ Word 𝑉)
cshwcshid.2	⊢ (𝜑 → (♯‘𝑥) = (♯‘𝑦))

Assertion

Ref	Expression
cshwcshid	⊢ (𝜑 → ((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)))

Distinct variable group:   𝑚,𝑛,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑚,𝑛)   𝑉(𝑥,𝑦,𝑚,𝑛)

Proof of Theorem cshwcshid

Step	Hyp	Ref	Expression
1		fznn0sub2 13610	. . . . . . 7 ⊢ (𝑚 ∈ (0...(♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑦)))
2		oveq2 7419	. . . . . . . 8 ⊢ ((♯‘𝑥) = (♯‘𝑦) → (0...(♯‘𝑥)) = (0...(♯‘𝑦)))
3	2	eleq2d 2819	. . . . . . 7 ⊢ ((♯‘𝑥) = (♯‘𝑦) → (((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥)) ↔ ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑦))))
4	1, 3	imbitrrid 245	. . . . . 6 ⊢ ((♯‘𝑥) = (♯‘𝑦) → (𝑚 ∈ (0...(♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥))))
5		cshwcshid.2	. . . . . 6 ⊢ (𝜑 → (♯‘𝑥) = (♯‘𝑦))
6	4, 5	syl11 33	. . . . 5 ⊢ (𝑚 ∈ (0...(♯‘𝑦)) → (𝜑 → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥))))
7	6	adantr 481	. . . 4 ⊢ ((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → (𝜑 → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥))))
8	7	impcom 408	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥)))
9		cshwcshid.1	. . . . . . . 8 ⊢ (𝜑 → 𝑦 ∈ Word 𝑉)
10		simpl 483	. . . . . . . . 9 ⊢ ((𝑦 ∈ Word 𝑉 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → 𝑦 ∈ Word 𝑉)
11		elfzelz 13503	. . . . . . . . . 10 ⊢ (𝑚 ∈ (0...(♯‘𝑦)) → 𝑚 ∈ ℤ)
12	11	adantl 482	. . . . . . . . 9 ⊢ ((𝑦 ∈ Word 𝑉 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → 𝑚 ∈ ℤ)
13		elfz2nn0 13594	. . . . . . . . . . 11 ⊢ (𝑚 ∈ (0...(♯‘𝑦)) ↔ (𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0 ∧ 𝑚 ≤ (♯‘𝑦)))
14		nn0z 12585	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑦) ∈ ℕ0 → (♯‘𝑦) ∈ ℤ)
15		nn0z 12585	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ ℤ)
16		zsubcl 12606	. . . . . . . . . . . . 13 ⊢ (((♯‘𝑦) ∈ ℤ ∧ 𝑚 ∈ ℤ) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
17	14, 15, 16	syl2anr 597	. . . . . . . . . . . 12 ⊢ ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
18	17	3adant3 1132	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0 ∧ 𝑚 ≤ (♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
19	13, 18	sylbi 216	. . . . . . . . . 10 ⊢ (𝑚 ∈ (0...(♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
20	19	adantl 482	. . . . . . . . 9 ⊢ ((𝑦 ∈ Word 𝑉 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
21	10, 12, 20	3jca 1128	. . . . . . . 8 ⊢ ((𝑦 ∈ Word 𝑉 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 ∈ Word 𝑉 ∧ 𝑚 ∈ ℤ ∧ ((♯‘𝑦) − 𝑚) ∈ ℤ))
22	9, 21	sylan 580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 ∈ Word 𝑉 ∧ 𝑚 ∈ ℤ ∧ ((♯‘𝑦) − 𝑚) ∈ ℤ))
23		2cshw 14765	. . . . . . 7 ⊢ ((𝑦 ∈ Word 𝑉 ∧ 𝑚 ∈ ℤ ∧ ((♯‘𝑦) − 𝑚) ∈ ℤ) → ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)) = (𝑦 cyclShift (𝑚 + ((♯‘𝑦) − 𝑚))))
24	22, 23	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)) = (𝑦 cyclShift (𝑚 + ((♯‘𝑦) − 𝑚))))
25		nn0cn 12484	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ ℂ)
26		nn0cn 12484	. . . . . . . . . . . 12 ⊢ ((♯‘𝑦) ∈ ℕ0 → (♯‘𝑦) ∈ ℂ)
27	25, 26	anim12i 613	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0) → (𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ))
28	27	3adant3 1132	. . . . . . . . . 10 ⊢ ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0 ∧ 𝑚 ≤ (♯‘𝑦)) → (𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ))
29	13, 28	sylbi 216	. . . . . . . . 9 ⊢ (𝑚 ∈ (0...(♯‘𝑦)) → (𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ))
30		pncan3 11470	. . . . . . . . 9 ⊢ ((𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ) → (𝑚 + ((♯‘𝑦) − 𝑚)) = (♯‘𝑦))
31	29, 30	syl 17	. . . . . . . 8 ⊢ (𝑚 ∈ (0...(♯‘𝑦)) → (𝑚 + ((♯‘𝑦) − 𝑚)) = (♯‘𝑦))
32	31	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → (𝑚 + ((♯‘𝑦) − 𝑚)) = (♯‘𝑦))
33	32	oveq2d 7427	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 cyclShift (𝑚 + ((♯‘𝑦) − 𝑚))) = (𝑦 cyclShift (♯‘𝑦)))
34		cshwn 14749	. . . . . . . 8 ⊢ (𝑦 ∈ Word 𝑉 → (𝑦 cyclShift (♯‘𝑦)) = 𝑦)
35	9, 34	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑦 cyclShift (♯‘𝑦)) = 𝑦)
36	35	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 cyclShift (♯‘𝑦)) = 𝑦)
37	24, 33, 36	3eqtrrd 2777	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...(♯‘𝑦))) → 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)))
38	37	adantrr 715	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)))
39		oveq1 7418	. . . . . . 7 ⊢ (𝑥 = (𝑦 cyclShift 𝑚) → (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)))
40	39	eqeq2d 2743	. . . . . 6 ⊢ (𝑥 = (𝑦 cyclShift 𝑚) → (𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) ↔ 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚))))
41	40	adantl 482	. . . . 5 ⊢ ((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → (𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) ↔ 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚))))
42	41	adantl 482	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → (𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) ↔ 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚))))
43	38, 42	mpbird 256	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → 𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)))
44		oveq2 7419	. . . 4 ⊢ (𝑛 = ((♯‘𝑦) − 𝑚) → (𝑥 cyclShift 𝑛) = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)))
45	44	rspceeqv 3633	. . 3 ⊢ ((((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥)) ∧ 𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚))) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑦 = (𝑥 cyclShift 𝑛))
46	8, 43, 45	syl2anc 584	. 2 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑦 = (𝑥 cyclShift 𝑛))
47	46	ex 413	1 ⊢ (𝜑 → ((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∃wrex 3070   class class class wbr 5148  ‘cfv 6543  (class class class)co 7411  ℂcc 11110  0cc0 11112   + caddc 11115   ≤ cle 11251   − cmin 11446  ℕ₀cn0 12474  ℤcz 12560  ...cfz 13486  ♯chash 14292  Word cword 14466   cyclShift ccsh 14740

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727  ax-cnex 11168  ax-resscn 11169  ax-1cn 11170  ax-icn 11171  ax-addcl 11172  ax-addrcl 11173  ax-mulcl 11174  ax-mulrcl 11175  ax-mulcom 11176  ax-addass 11177  ax-mulass 11178  ax-distr 11179  ax-i2m1 11180  ax-1ne0 11181  ax-1rid 11182  ax-rnegex 11183  ax-rrecex 11184  ax-cnre 11185  ax-pre-lttri 11186  ax-pre-lttrn 11187  ax-pre-ltadd 11188  ax-pre-mulgt0 11189  ax-pre-sup 11190

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7367  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7858  df-1st 7977  df-2nd 7978  df-frecs 8268  df-wrecs 8299  df-recs 8373  df-rdg 8412  df-1o 8468  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-sup 9439  df-inf 9440  df-card 9936  df-pnf 11252  df-mnf 11253  df-xr 11254  df-ltxr 11255  df-le 11256  df-sub 11448  df-neg 11449  df-div 11874  df-nn 12215  df-2 12277  df-n0 12475  df-z 12561  df-uz 12825  df-rp 12977  df-fz 13487  df-fzo 13630  df-fl 13759  df-mod 13837  df-hash 14293  df-word 14467  df-concat 14523  df-substr 14593  df-pfx 14623  df-csh 14741

This theorem is referenced by:  erclwwlksym  29312  erclwwlknsym  29361