Theorem erclwwlkeq 29953

Description: Two classes are equivalent regarding ∼ if both are words and one is the other cyclically shifted. (Contributed by Alexander van der Vekens, 25-Mar-2018.) (Revised by AV, 29-Apr-2021.)

Hypothesis

Ref	Expression
erclwwlk.r	⊢ ∼ = {⟨𝑢, 𝑤⟩ ∣ (𝑢 ∈ (ClWWalks‘𝐺) ∧ 𝑤 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛))}

Assertion

Ref	Expression
erclwwlkeq	⊢ ((𝑈 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑈 ∼ 𝑊 ↔ (𝑈 ∈ (ClWWalks‘𝐺) ∧ 𝑊 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑊))𝑈 = (𝑊 cyclShift 𝑛))))

Distinct variable groups:   𝑛,𝐺,𝑢,𝑤   𝑈,𝑛,𝑢,𝑤   𝑛,𝑊,𝑢,𝑤

Allowed substitution hints:   ∼ (𝑤,𝑢,𝑛)   𝑋(𝑤,𝑢,𝑛)   𝑌(𝑤,𝑢,𝑛)

Proof of Theorem erclwwlkeq

Step	Hyp	Ref	Expression
1		eleq1 2817	. . . 4 ⊢ (𝑢 = 𝑈 → (𝑢 ∈ (ClWWalks‘𝐺) ↔ 𝑈 ∈ (ClWWalks‘𝐺)))
2	1	adantr 480	. . 3 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → (𝑢 ∈ (ClWWalks‘𝐺) ↔ 𝑈 ∈ (ClWWalks‘𝐺)))
3		eleq1 2817	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑤 ∈ (ClWWalks‘𝐺) ↔ 𝑊 ∈ (ClWWalks‘𝐺)))
4	3	adantl 481	. . 3 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → (𝑤 ∈ (ClWWalks‘𝐺) ↔ 𝑊 ∈ (ClWWalks‘𝐺)))
5		fveq2 6860	. . . . . 6 ⊢ (𝑤 = 𝑊 → (♯‘𝑤) = (♯‘𝑊))
6	5	oveq2d 7405	. . . . 5 ⊢ (𝑤 = 𝑊 → (0...(♯‘𝑤)) = (0...(♯‘𝑊)))
7	6	adantl 481	. . . 4 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → (0...(♯‘𝑤)) = (0...(♯‘𝑊)))
8		simpl 482	. . . . 5 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → 𝑢 = 𝑈)
9		oveq1 7396	. . . . . 6 ⊢ (𝑤 = 𝑊 → (𝑤 cyclShift 𝑛) = (𝑊 cyclShift 𝑛))
10	9	adantl 481	. . . . 5 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → (𝑤 cyclShift 𝑛) = (𝑊 cyclShift 𝑛))
11	8, 10	eqeq12d 2746	. . . 4 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → (𝑢 = (𝑤 cyclShift 𝑛) ↔ 𝑈 = (𝑊 cyclShift 𝑛)))
12	7, 11	rexeqbidv 3322	. . 3 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → (∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛) ↔ ∃𝑛 ∈ (0...(♯‘𝑊))𝑈 = (𝑊 cyclShift 𝑛)))
13	2, 4, 12	3anbi123d 1438	. 2 ⊢ ((𝑢 = 𝑈 ∧ 𝑤 = 𝑊) → ((𝑢 ∈ (ClWWalks‘𝐺) ∧ 𝑤 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛)) ↔ (𝑈 ∈ (ClWWalks‘𝐺) ∧ 𝑊 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑊))𝑈 = (𝑊 cyclShift 𝑛))))
14		erclwwlk.r	. 2 ⊢ ∼ = {⟨𝑢, 𝑤⟩ ∣ (𝑢 ∈ (ClWWalks‘𝐺) ∧ 𝑤 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛))}
15	13, 14	brabga 5496	1 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑈 ∼ 𝑊 ↔ (𝑈 ∈ (ClWWalks‘𝐺) ∧ 𝑊 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑊))𝑈 = (𝑊 cyclShift 𝑛))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∃wrex 3054   class class class wbr 5109  {copab 5171  ‘cfv 6513  (class class class)co 7389  0cc0 11074  ...cfz 13474  ♯chash 14301   cyclShift ccsh 14759  ClWWalkscclwwlk 29916

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702  ax-sep 5253  ax-nul 5263  ax-pr 5389

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3919  df-un 3921  df-ss 3933  df-nul 4299  df-if 4491  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5110  df-opab 5172  df-iota 6466  df-fv 6521  df-ov 7392

This theorem is referenced by:  erclwwlkeqlen  29954  erclwwlkref  29955  erclwwlksym  29956  erclwwlktr  29957