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

Theorem eleclclwwlkn 27850
Description: A member of an equivalence class according to . (Contributed by Alexander van der Vekens, 11-May-2018.) (Revised by AV, 1-May-2021.)
Hypotheses
Ref Expression
erclwwlkn.w 𝑊 = (𝑁 ClWWalksN 𝐺)
erclwwlkn.r = {⟨𝑡, 𝑢⟩ ∣ (𝑡𝑊𝑢𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
Assertion
Ref Expression
eleclclwwlkn ((𝐵 ∈ (𝑊 / ) ∧ 𝑋𝐵) → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
Distinct variable groups:   𝑡,𝑊,𝑢   𝑛,𝑁,𝑢,𝑡   𝑛,𝑊   𝑛,𝐺   𝑛,𝑋   𝑛,𝑌
Allowed substitution hints:   𝐵(𝑢,𝑡,𝑛)   (𝑢,𝑡,𝑛)   𝐺(𝑢,𝑡)   𝑋(𝑢,𝑡)   𝑌(𝑢,𝑡)

Proof of Theorem eleclclwwlkn
Dummy variables 𝑥 𝑦 𝑚 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 erclwwlkn.w . . . . 5 𝑊 = (𝑁 ClWWalksN 𝐺)
2 erclwwlkn.r . . . . 5 = {⟨𝑡, 𝑢⟩ ∣ (𝑡𝑊𝑢𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
31, 2eclclwwlkn1 27849 . . . 4 (𝐵 ∈ (𝑊 / ) → (𝐵 ∈ (𝑊 / ) ↔ ∃𝑥𝑊 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
4 eqeq1 2828 . . . . . . . . . 10 (𝑦 = 𝑌 → (𝑦 = (𝑥 cyclShift 𝑛) ↔ 𝑌 = (𝑥 cyclShift 𝑛)))
54rexbidv 3289 . . . . . . . . 9 (𝑦 = 𝑌 → (∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑛)))
65elrab 3665 . . . . . . . 8 (𝑌 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑛)))
7 oveq2 7146 . . . . . . . . . . . 12 (𝑛 = 𝑘 → (𝑥 cyclShift 𝑛) = (𝑥 cyclShift 𝑘))
87eqeq2d 2835 . . . . . . . . . . 11 (𝑛 = 𝑘 → (𝑌 = (𝑥 cyclShift 𝑛) ↔ 𝑌 = (𝑥 cyclShift 𝑘)))
98cbvrexvw 3435 . . . . . . . . . 10 (∃𝑛 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑛) ↔ ∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘))
10 eqeq1 2828 . . . . . . . . . . . . . . . 16 (𝑦 = 𝑋 → (𝑦 = (𝑥 cyclShift 𝑛) ↔ 𝑋 = (𝑥 cyclShift 𝑛)))
1110rexbidv 3289 . . . . . . . . . . . . . . 15 (𝑦 = 𝑋 → (∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛) ↔ ∃𝑛 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑛)))
1211elrab 3665 . . . . . . . . . . . . . 14 (𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ (𝑋𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑛)))
13 oveq2 7146 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑚 → (𝑥 cyclShift 𝑛) = (𝑥 cyclShift 𝑚))
1413eqeq2d 2835 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑚 → (𝑋 = (𝑥 cyclShift 𝑛) ↔ 𝑋 = (𝑥 cyclShift 𝑚)))
1514cbvrexvw 3435 . . . . . . . . . . . . . . . . 17 (∃𝑛 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑛) ↔ ∃𝑚 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑚))
161eleclclwwlknlem2 27835 . . . . . . . . . . . . . . . . . . 19 (((𝑚 ∈ (0...𝑁) ∧ 𝑋 = (𝑥 cyclShift 𝑚)) ∧ (𝑋𝑊𝑥𝑊)) → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))
1716ex 416 . . . . . . . . . . . . . . . . . 18 ((𝑚 ∈ (0...𝑁) ∧ 𝑋 = (𝑥 cyclShift 𝑚)) → ((𝑋𝑊𝑥𝑊) → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
1817rexlimiva 3273 . . . . . . . . . . . . . . . . 17 (∃𝑚 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑚) → ((𝑋𝑊𝑥𝑊) → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
1915, 18sylbi 220 . . . . . . . . . . . . . . . 16 (∃𝑛 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑛) → ((𝑋𝑊𝑥𝑊) → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
2019expd 419 . . . . . . . . . . . . . . 15 (∃𝑛 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑛) → (𝑋𝑊 → (𝑥𝑊 → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))))
2120impcom 411 . . . . . . . . . . . . . 14 ((𝑋𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑋 = (𝑥 cyclShift 𝑛)) → (𝑥𝑊 → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
2212, 21sylbi 220 . . . . . . . . . . . . 13 (𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑥𝑊 → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
2322com12 32 . . . . . . . . . . . 12 (𝑥𝑊 → (𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
2423ad2antlr 726 . . . . . . . . . . 11 (((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → (𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
2524imp 410 . . . . . . . . . 10 ((((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) ∧ 𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → (∃𝑘 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑘) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))
269, 25syl5bb 286 . . . . . . . . 9 ((((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) ∧ 𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → (∃𝑛 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑛) ↔ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))
2726anbi2d 631 . . . . . . . 8 ((((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) ∧ 𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → ((𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑥 cyclShift 𝑛)) ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
286, 27syl5bb 286 . . . . . . 7 ((((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) ∧ 𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → (𝑌 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
2928ex 416 . . . . . 6 (((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → (𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑌 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))))
30 eleq2 2904 . . . . . . . 8 (𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑋𝐵𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
31 eleq2 2904 . . . . . . . . 9 (𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑌𝐵𝑌 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
3231bibi1d 347 . . . . . . . 8 (𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))) ↔ (𝑌 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))))
3330, 32imbi12d 348 . . . . . . 7 (𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((𝑋𝐵 → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))) ↔ (𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑌 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))))
3433adantl 485 . . . . . 6 (((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → ((𝑋𝐵 → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))) ↔ (𝑋 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑌 ∈ {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))))
3529, 34mpbird 260 . . . . 5 (((𝐵 ∈ (𝑊 / ) ∧ 𝑥𝑊) ∧ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}) → (𝑋𝐵 → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))))
3635rexlimdva2 3279 . . . 4 (𝐵 ∈ (𝑊 / ) → (∃𝑥𝑊 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑋𝐵 → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))))
373, 36sylbid 243 . . 3 (𝐵 ∈ (𝑊 / ) → (𝐵 ∈ (𝑊 / ) → (𝑋𝐵 → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))))
3837pm2.43i 52 . 2 (𝐵 ∈ (𝑊 / ) → (𝑋𝐵 → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛)))))
3938imp 410 1 ((𝐵 ∈ (𝑊 / ) ∧ 𝑋𝐵) → (𝑌𝐵 ↔ (𝑌𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑌 = (𝑋 cyclShift 𝑛))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2115  wrex 3133  {crab 3136  {copab 5109  (class class class)co 7138   / cqs 8271  0cc0 10522  ...cfz 12883   cyclShift ccsh 14139   ClWWalksN cclwwlkn 27798
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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5171  ax-sep 5184  ax-nul 5191  ax-pow 5247  ax-pr 5311  ax-un 7444  ax-cnex 10578  ax-resscn 10579  ax-1cn 10580  ax-icn 10581  ax-addcl 10582  ax-addrcl 10583  ax-mulcl 10584  ax-mulrcl 10585  ax-mulcom 10586  ax-addass 10587  ax-mulass 10588  ax-distr 10589  ax-i2m1 10590  ax-1ne0 10591  ax-1rid 10592  ax-rnegex 10593  ax-rrecex 10594  ax-cnre 10595  ax-pre-lttri 10596  ax-pre-lttrn 10597  ax-pre-ltadd 10598  ax-pre-mulgt0 10599  ax-pre-sup 10600
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3014  df-nel 3118  df-ral 3137  df-rex 3138  df-reu 3139  df-rmo 3140  df-rab 3141  df-v 3481  df-sbc 3758  df-csb 3866  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-pss 3937  df-nul 4275  df-if 4449  df-pw 4522  df-sn 4549  df-pr 4551  df-tp 4553  df-op 4555  df-uni 4820  df-int 4858  df-iun 4902  df-br 5048  df-opab 5110  df-mpt 5128  df-tr 5154  df-id 5441  df-eprel 5446  df-po 5455  df-so 5456  df-fr 5495  df-we 5497  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6129  df-ord 6175  df-on 6176  df-lim 6177  df-suc 6178  df-iota 6295  df-fun 6338  df-fn 6339  df-f 6340  df-f1 6341  df-fo 6342  df-f1o 6343  df-fv 6344  df-riota 7096  df-ov 7141  df-oprab 7142  df-mpo 7143  df-om 7564  df-1st 7672  df-2nd 7673  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-ec 8274  df-qs 8278  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-sup 8890  df-inf 8891  df-card 9352  df-pnf 10662  df-mnf 10663  df-xr 10664  df-ltxr 10665  df-le 10666  df-sub 10857  df-neg 10858  df-div 11283  df-nn 11624  df-2 11686  df-n0 11884  df-z 11968  df-uz 12230  df-rp 12376  df-fz 12884  df-fzo 13027  df-fl 13155  df-mod 13231  df-hash 13685  df-word 13856  df-concat 13912  df-substr 13992  df-pfx 14022  df-csh 14140  df-clwwlk 27756  df-clwwlkn 27799
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator