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

Theorem cshwcshid 14787
Description: A cyclically shifted word can be reconstructed by cyclically shifting it again. Lemma for erclwwlksym 30116 and erclwwlknsym 30165. (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
StepHypRef Expression
1 fznn0sub2 13587 . . . . . . 7 (𝑚 ∈ (0...(♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑦)))
2 oveq2 7371 . . . . . . . 8 ((♯‘𝑥) = (♯‘𝑦) → (0...(♯‘𝑥)) = (0...(♯‘𝑦)))
32eleq2d 2826 . . . . . . 7 ((♯‘𝑥) = (♯‘𝑦) → (((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥)) ↔ ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑦))))
41, 3imbitrrid 247 . . . . . 6 ((♯‘𝑥) = (♯‘𝑦) → (𝑚 ∈ (0...(♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥))))
5 cshwcshid.2 . . . . . 6 (𝜑 → (♯‘𝑥) = (♯‘𝑦))
64, 5syl11 33 . . . . 5 (𝑚 ∈ (0...(♯‘𝑦)) → (𝜑 → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥))))
76adantr 481 . . . 4 ((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → (𝜑 → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥))))
87impcom 408 . . 3 ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → ((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥)))
9 cshwcshid.1 . . . . . . . 8 (𝜑𝑦 ∈ Word 𝑉)
10 simpl 483 . . . . . . . . 9 ((𝑦 ∈ Word 𝑉𝑚 ∈ (0...(♯‘𝑦))) → 𝑦 ∈ Word 𝑉)
11 elfzelz 13476 . . . . . . . . . 10 (𝑚 ∈ (0...(♯‘𝑦)) → 𝑚 ∈ ℤ)
1211adantl 482 . . . . . . . . 9 ((𝑦 ∈ Word 𝑉𝑚 ∈ (0...(♯‘𝑦))) → 𝑚 ∈ ℤ)
13 elfz2nn0 13570 . . . . . . . . . . 11 (𝑚 ∈ (0...(♯‘𝑦)) ↔ (𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0𝑚 ≤ (♯‘𝑦)))
14 nn0z 12546 . . . . . . . . . . . . 13 ((♯‘𝑦) ∈ ℕ0 → (♯‘𝑦) ∈ ℤ)
15 nn0z 12546 . . . . . . . . . . . . 13 (𝑚 ∈ ℕ0𝑚 ∈ ℤ)
16 zsubcl 12567 . . . . . . . . . . . . 13 (((♯‘𝑦) ∈ ℤ ∧ 𝑚 ∈ ℤ) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
1714, 15, 16syl2anr 603 . . . . . . . . . . . 12 ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
18173adant3 1138 . . . . . . . . . . 11 ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0𝑚 ≤ (♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
1913, 18sylbi 218 . . . . . . . . . 10 (𝑚 ∈ (0...(♯‘𝑦)) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
2019adantl 482 . . . . . . . . 9 ((𝑦 ∈ Word 𝑉𝑚 ∈ (0...(♯‘𝑦))) → ((♯‘𝑦) − 𝑚) ∈ ℤ)
2110, 12, 203jca 1134 . . . . . . . 8 ((𝑦 ∈ Word 𝑉𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 ∈ Word 𝑉𝑚 ∈ ℤ ∧ ((♯‘𝑦) − 𝑚) ∈ ℤ))
229, 21sylan 586 . . . . . . 7 ((𝜑𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 ∈ Word 𝑉𝑚 ∈ ℤ ∧ ((♯‘𝑦) − 𝑚) ∈ ℤ))
23 2cshw 14773 . . . . . . 7 ((𝑦 ∈ Word 𝑉𝑚 ∈ ℤ ∧ ((♯‘𝑦) − 𝑚) ∈ ℤ) → ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)) = (𝑦 cyclShift (𝑚 + ((♯‘𝑦) − 𝑚))))
2422, 23syl 17 . . . . . 6 ((𝜑𝑚 ∈ (0...(♯‘𝑦))) → ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)) = (𝑦 cyclShift (𝑚 + ((♯‘𝑦) − 𝑚))))
25 nn0cn 12445 . . . . . . . . . . . 12 (𝑚 ∈ ℕ0𝑚 ∈ ℂ)
26 nn0cn 12445 . . . . . . . . . . . 12 ((♯‘𝑦) ∈ ℕ0 → (♯‘𝑦) ∈ ℂ)
2725, 26anim12i 619 . . . . . . . . . . 11 ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0) → (𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ))
28273adant3 1138 . . . . . . . . . 10 ((𝑚 ∈ ℕ0 ∧ (♯‘𝑦) ∈ ℕ0𝑚 ≤ (♯‘𝑦)) → (𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ))
2913, 28sylbi 218 . . . . . . . . 9 (𝑚 ∈ (0...(♯‘𝑦)) → (𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ))
30 pncan3 11399 . . . . . . . . 9 ((𝑚 ∈ ℂ ∧ (♯‘𝑦) ∈ ℂ) → (𝑚 + ((♯‘𝑦) − 𝑚)) = (♯‘𝑦))
3129, 30syl 17 . . . . . . . 8 (𝑚 ∈ (0...(♯‘𝑦)) → (𝑚 + ((♯‘𝑦) − 𝑚)) = (♯‘𝑦))
3231adantl 482 . . . . . . 7 ((𝜑𝑚 ∈ (0...(♯‘𝑦))) → (𝑚 + ((♯‘𝑦) − 𝑚)) = (♯‘𝑦))
3332oveq2d 7379 . . . . . 6 ((𝜑𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 cyclShift (𝑚 + ((♯‘𝑦) − 𝑚))) = (𝑦 cyclShift (♯‘𝑦)))
34 cshwn 14757 . . . . . . . 8 (𝑦 ∈ Word 𝑉 → (𝑦 cyclShift (♯‘𝑦)) = 𝑦)
359, 34syl 17 . . . . . . 7 (𝜑 → (𝑦 cyclShift (♯‘𝑦)) = 𝑦)
3635adantr 481 . . . . . 6 ((𝜑𝑚 ∈ (0...(♯‘𝑦))) → (𝑦 cyclShift (♯‘𝑦)) = 𝑦)
3724, 33, 363eqtrrd 2780 . . . . 5 ((𝜑𝑚 ∈ (0...(♯‘𝑦))) → 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)))
3837adantrr 723 . . . 4 ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)))
39 oveq1 7370 . . . . . . 7 (𝑥 = (𝑦 cyclShift 𝑚) → (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚)))
4039eqeq2d 2751 . . . . . 6 (𝑥 = (𝑦 cyclShift 𝑚) → (𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) ↔ 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚))))
4140adantl 482 . . . . 5 ((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → (𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) ↔ 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚))))
4241adantl 482 . . . 4 ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → (𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)) ↔ 𝑦 = ((𝑦 cyclShift 𝑚) cyclShift ((♯‘𝑦) − 𝑚))))
4338, 42mpbird 258 . . 3 ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → 𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)))
44 oveq2 7371 . . . 4 (𝑛 = ((♯‘𝑦) − 𝑚) → (𝑥 cyclShift 𝑛) = (𝑥 cyclShift ((♯‘𝑦) − 𝑚)))
4544rspceeqv 3590 . . 3 ((((♯‘𝑦) − 𝑚) ∈ (0...(♯‘𝑥)) ∧ 𝑦 = (𝑥 cyclShift ((♯‘𝑦) − 𝑚))) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑦 = (𝑥 cyclShift 𝑛))
468, 43, 45syl2anc 590 . 2 ((𝜑 ∧ (𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚))) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑦 = (𝑥 cyclShift 𝑛))
4746ex 413 1 (𝜑 → ((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wrex 3064   class class class wbr 5079  cfv 6492  (class class class)co 7363  cc 11034  0cc0 11036   + caddc 11039  cle 11178  cmin 11375  0cn0 12435  cz 12522  ...cfz 13459  chash 14290  Word cword 14473   cyclShift ccsh 14748
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-resscn 11093  ax-1cn 11094  ax-icn 11095  ax-addcl 11096  ax-addrcl 11097  ax-mulcl 11098  ax-mulrcl 11099  ax-mulcom 11100  ax-addass 11101  ax-mulass 11102  ax-distr 11103  ax-i2m1 11104  ax-1ne0 11105  ax-1rid 11106  ax-rnegex 11107  ax-rrecex 11108  ax-cnre 11109  ax-pre-lttri 11110  ax-pre-lttrn 11111  ax-pre-ltadd 11112  ax-pre-mulgt0 11113  ax-pre-sup 11114
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-om 7814  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-1o 8402  df-er 8640  df-en 8891  df-dom 8892  df-sdom 8893  df-fin 8894  df-sup 9352  df-inf 9353  df-card 9861  df-pnf 11179  df-mnf 11180  df-xr 11181  df-ltxr 11182  df-le 11183  df-sub 11377  df-neg 11378  df-div 11806  df-nn 12173  df-2 12242  df-n0 12436  df-z 12523  df-uz 12787  df-rp 12941  df-fz 13460  df-fzo 13607  df-fl 13749  df-mod 13827  df-hash 14291  df-word 14474  df-concat 14531  df-substr 14602  df-pfx 14632  df-csh 14749
This theorem is referenced by:  erclwwlksym  30116  erclwwlknsym  30165
  Copyright terms: Public domain W3C validator