Theorem erclwwlkref 28384

Description: ∼ is a reflexive relation over the set of closed walks (defined as words). (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
erclwwlkref	⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ 𝑥 ∼ 𝑥)

Distinct variable groups:   𝑛,𝐺,𝑢,𝑤   𝑥,𝑛,𝑢,𝑤

Allowed substitution hints:   ∼ (𝑥,𝑤,𝑢,𝑛)   𝐺(𝑥)

Proof of Theorem erclwwlkref

Step	Hyp	Ref	Expression
1		anidm 565	. . . 4 ⊢ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺)) ↔ 𝑥 ∈ (ClWWalks‘𝐺))
2	1	anbi1i 624	. . 3 ⊢ (((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺)) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)))
3		df-3an 1088	. . 3 ⊢ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)) ↔ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺)) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)))
4		eqid 2738	. . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
5	4	clwwlkbp 28349	. . . . 5 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) → (𝐺 ∈ V ∧ 𝑥 ∈ Word (Vtx‘𝐺) ∧ 𝑥 ≠ ∅))
6		cshw0 14507	. . . . . . 7 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → (𝑥 cyclShift 0) = 𝑥)
7		0nn0 12248	. . . . . . . . . 10 ⊢ 0 ∈ ℕ0
8	7	a1i 11	. . . . . . . . 9 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → 0 ∈ ℕ0)
9		lencl 14236	. . . . . . . . 9 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → (♯‘𝑥) ∈ ℕ0)
10		hashge0 14102	. . . . . . . . 9 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → 0 ≤ (♯‘𝑥))
11		elfz2nn0 13347	. . . . . . . . 9 ⊢ (0 ∈ (0...(♯‘𝑥)) ↔ (0 ∈ ℕ0 ∧ (♯‘𝑥) ∈ ℕ0 ∧ 0 ≤ (♯‘𝑥)))
12	8, 9, 10, 11	syl3anbrc 1342	. . . . . . . 8 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → 0 ∈ (0...(♯‘𝑥)))
13		eqcom 2745	. . . . . . . . 9 ⊢ ((𝑥 cyclShift 0) = 𝑥 ↔ 𝑥 = (𝑥 cyclShift 0))
14	13	biimpi 215	. . . . . . . 8 ⊢ ((𝑥 cyclShift 0) = 𝑥 → 𝑥 = (𝑥 cyclShift 0))
15		oveq2 7283	. . . . . . . . 9 ⊢ (𝑛 = 0 → (𝑥 cyclShift 𝑛) = (𝑥 cyclShift 0))
16	15	rspceeqv 3575	. . . . . . . 8 ⊢ ((0 ∈ (0...(♯‘𝑥)) ∧ 𝑥 = (𝑥 cyclShift 0)) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))
17	12, 14, 16	syl2an 596	. . . . . . 7 ⊢ ((𝑥 ∈ Word (Vtx‘𝐺) ∧ (𝑥 cyclShift 0) = 𝑥) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))
18	6, 17	mpdan 684	. . . . . 6 ⊢ (𝑥 ∈ Word (Vtx‘𝐺) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))
19	18	3ad2ant2 1133	. . . . 5 ⊢ ((𝐺 ∈ V ∧ 𝑥 ∈ Word (Vtx‘𝐺) ∧ 𝑥 ≠ ∅) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))
20	5, 19	syl 17	. . . 4 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) → ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))
21	20	pm4.71i 560	. . 3 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)))
22	2, 3, 21	3bitr4ri 304	. 2 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)))
23		erclwwlk.r	. . . 4 ⊢ ∼ = {⟨𝑢, 𝑤⟩ ∣ (𝑢 ∈ (ClWWalks‘𝐺) ∧ 𝑤 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛))}
24	23	erclwwlkeq 28382	. . 3 ⊢ ((𝑥 ∈ V ∧ 𝑥 ∈ V) → (𝑥 ∼ 𝑥 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛))))
25	24	el2v 3440	. 2 ⊢ (𝑥 ∼ 𝑥 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑥 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑥))𝑥 = (𝑥 cyclShift 𝑛)))
26	22, 25	bitr4i 277	1 ⊢ (𝑥 ∈ (ClWWalks‘𝐺) ↔ 𝑥 ∼ 𝑥)

Syntax hints:   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  ∃wrex 3065  Vcvv 3432  ∅c0 4256   class class class wbr 5074  {copab 5136  ‘cfv 6433  (class class class)co 7275  0cc0 10871   ≤ cle 11010  ℕ₀cn0 12233  ...cfz 13239  ♯chash 14044  Word cword 14217   cyclShift ccsh 14501  Vtxcvtx 27366  ClWWalkscclwwlk 28345

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-oadd 8301  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-sup 9201  df-inf 9202  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-n0 12234  df-xnn0 12306  df-z 12320  df-uz 12583  df-rp 12731  df-fz 13240  df-fzo 13383  df-fl 13512  df-mod 13590  df-hash 14045  df-word 14218  df-concat 14274  df-substr 14354  df-pfx 14384  df-csh 14502  df-clwwlk 28346

This theorem is referenced by:  erclwwlk  28387