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

Theorem erclwwlkneq 30717
Description: Two classes are equivalent regarding ∼ if both are words of the same fixed length and one is the other cyclically shifted. (Contributed by Alexander van der Vekens, 25-Mar-2018.) (Revised by AV, 30-Apr-2021.)
Hypotheses
Ref Expression
erclwwlkn.w 𝑊 = (𝑁 ClWWalksN 𝐺)
erclwwlkn.r ∼ = {⟨𝑡, 𝑢⟩ ∣ (𝑡 ∈ 𝑊 ∧ 𝑢 ∈ 𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
Assertion
Ref Expression
erclwwlkneq ((𝑇 ∈ 𝑋 ∧ 𝑈 ∈ 𝑌) → (𝑇 ∼ 𝑈 ↔ (𝑇 ∈ 𝑊 ∧ 𝑈 ∈ 𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑇 = (𝑈 cyclShift 𝑛))))
Distinct variable groups:   𝑡,𝑊,𝑢   𝑡,𝑁,𝑢   𝑇,𝑛,𝑡,𝑢   𝑈,𝑛,𝑡,𝑢
Allowed substitution hints:   ∼ (𝑢, 𝑡, 𝑛)   𝐺(𝑢, 𝑡, 𝑛)   𝑁(𝑛)   𝑊(𝑛)   𝑋(𝑢, 𝑡, 𝑛)   𝑌(𝑢, 𝑡, 𝑛)

Proof of Theorem erclwwlkneq
StepHypRef Expression
1 eleq1 2855 . . . 4 (𝑡 = 𝑇 → (𝑡 ∈ 𝑊 ↔ 𝑇 ∈ 𝑊))
21adantr 486 . . 3 ((𝑡 = 𝑇 ∧ 𝑢 = 𝑈) → (𝑡 ∈ 𝑊 ↔ 𝑇 ∈ 𝑊))
3 eleq1 2855 . . . 4 (𝑢 = 𝑈 → (𝑢 ∈ 𝑊 ↔ 𝑈 ∈ 𝑊))
43adantl 487 . . 3 ((𝑡 = 𝑇 ∧ 𝑢 = 𝑈) → (𝑢 ∈ 𝑊 ↔ 𝑈 ∈ 𝑊))
5 simpl 488 . . . . 5 ((𝑡 = 𝑇 ∧ 𝑢 = 𝑈) → 𝑡 = 𝑇)
6 oveq1 7457 . . . . . 6 (𝑢 = 𝑈 → (𝑢 cyclShift 𝑛) = (𝑈 cyclShift 𝑛))
76adantl 487 . . . . 5 ((𝑡 = 𝑇 ∧ 𝑢 = 𝑈) → (𝑢 cyclShift 𝑛) = (𝑈 cyclShift 𝑛))
85, 7eqeq12d 2782 . . . 4 ((𝑡 = 𝑇 ∧ 𝑢 = 𝑈) → (𝑡 = (𝑢 cyclShift 𝑛) ↔ 𝑇 = (𝑈 cyclShift 𝑛)))
98rexbidv 3193 . . 3 ((𝑡 = 𝑇 ∧ 𝑢 = 𝑈) → (∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛) ↔ ∃𝑛 ∈ (0...𝑁)𝑇 = (𝑈 cyclShift 𝑛)))
102, 4, 93anbi123d 1467 . 2 ((𝑡 = 𝑇 ∧ 𝑢 = 𝑈) → ((𝑡 ∈ 𝑊 ∧ 𝑢 ∈ 𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛)) ↔ (𝑇 ∈ 𝑊 ∧ 𝑈 ∈ 𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑇 = (𝑈 cyclShift 𝑛))))
11 erclwwlkn.r . 2 ∼ = {⟨𝑡, 𝑢⟩ ∣ (𝑡 ∈ 𝑊 ∧ 𝑢 ∈ 𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
1210, 11brabga 5514 1 ((𝑇 ∈ 𝑋 ∧ 𝑈 ∈ 𝑌) → (𝑇 ∼ 𝑈 ↔ (𝑇 ∈ 𝑊 ∧ 𝑈 ∈ 𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑇 = (𝑈 cyclShift 𝑛))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ∃wrex 3093   class class class wbr 5107  {copab 5172  (class class class)co 7450  0cc0 11238  ...cfz 13678   cyclShift ccsh 14980   ClWWalksN cclwwlkn 30674
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738  ax-sep 5254  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-iota 6519  df-fv 6573  df-ov 7453
This theorem is used by:  erclwwlkneqlen  30718  erclwwlknref  30719  erclwwlknsym  30720  erclwwlkntr  30721  eclclwwlkn1  30725
  Copyright terms: Public domain W3C validator