erclwwlktr - Metamath Proof Explorer

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

Theorem erclwwlktr 29275

Description: ∼ is a transitive relation over the set of closed walks (defined as words). (Contributed by Alexander van der Vekens, 10-Apr-2018.) (Revised by AV, 30-Apr-2021.)

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

**Assertion**
Ref	Expression
erclwwlktr	⊢ ((𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧) → 𝑥 ∼ 𝑧)

Distinct variable groups: 𝑛,𝐺,𝑢,𝑤 𝑥,𝑛,𝑢,𝑤,𝑦 𝑧,𝑛,𝑢,𝑤,𝑥 Allowed substitution hints: ∼ (𝑥,𝑦,𝑧,𝑤,𝑢,𝑛) 𝐺(𝑥,𝑦,𝑧)

Proof of Theorem erclwwlktr Dummy variables 𝑚 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3479	. 2 ⊢ 𝑥 ∈ V
2		vex 3479	. 2 ⊢ 𝑦 ∈ V
3		vex 3479	. 2 ⊢ 𝑧 ∈ V
4		erclwwlk.r	. . . . . 6 ⊢ ∼ = {⟨𝑢, 𝑤⟩ ∣ (𝑢 ∈ (ClWWalks‘𝐺) ∧ 𝑤 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑤))𝑢 = (𝑤 cyclShift 𝑛))}
5	4	erclwwlkeqlen 29272	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥 ∼ 𝑦 → (♯‘𝑥) = (♯‘𝑦)))
6	5	3adant3 1133	. . . 4 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ∼ 𝑦 → (♯‘𝑥) = (♯‘𝑦)))
7	4	erclwwlkeqlen 29272	. . . . . . 7 ⊢ ((𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑦 ∼ 𝑧 → (♯‘𝑦) = (♯‘𝑧)))
8	7	3adant1 1131	. . . . . 6 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑦 ∼ 𝑧 → (♯‘𝑦) = (♯‘𝑧)))
9	4	erclwwlkeq 29271	. . . . . . . 8 ⊢ ((𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑦 ∼ 𝑧 ↔ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))))
10	9	3adant1 1131	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑦 ∼ 𝑧 ↔ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))))
11	4	erclwwlkeq 29271	. . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥 ∼ 𝑦 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛))))
12	11	3adant3 1133	. . . . . . . . 9 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ∼ 𝑦 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛))))
13		simpr1 1195	. . . . . . . . . . . . . . 15 ⊢ (((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) ∧ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛))) → 𝑥 ∈ (ClWWalks‘𝐺))
14		simplr2 1217	. . . . . . . . . . . . . . 15 ⊢ (((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) ∧ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛))) → 𝑧 ∈ (ClWWalks‘𝐺))
15		oveq2 7417	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑛 = 𝑚 → (𝑦 cyclShift 𝑛) = (𝑦 cyclShift 𝑚))
16	15	eqeq2d 2744	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑛 = 𝑚 → (𝑥 = (𝑦 cyclShift 𝑛) ↔ 𝑥 = (𝑦 cyclShift 𝑚)))
17	16	cbvrexvw 3236	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) ↔ ∃𝑚 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑚))
18		oveq2 7417	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑛 = 𝑘 → (𝑧 cyclShift 𝑛) = (𝑧 cyclShift 𝑘))
19	18	eqeq2d 2744	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑛 = 𝑘 → (𝑦 = (𝑧 cyclShift 𝑛) ↔ 𝑦 = (𝑧 cyclShift 𝑘)))
20	19	cbvrexvw 3236	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛) ↔ ∃𝑘 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑘))
21		eqid 2733	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
22	21	clwwlkbp 29238	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑧 ∈ (ClWWalks‘𝐺) → (𝐺 ∈ V ∧ 𝑧 ∈ Word (Vtx‘𝐺) ∧ 𝑧 ≠ ∅))
23	22	simp2d 1144	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑧 ∈ (ClWWalks‘𝐺) → 𝑧 ∈ Word (Vtx‘𝐺))
24	23	ad2antlr 726	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) → 𝑧 ∈ Word (Vtx‘𝐺))
25		simpr 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) → ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)))
26	24, 25	cshwcsh2id 14779	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) → (((𝑚 ∈ (0...(♯‘𝑦)) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) ∧ (𝑘 ∈ (0...(♯‘𝑧)) ∧ 𝑦 = (𝑧 cyclShift 𝑘))) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛)))
27	26	exp5l 448	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) → (𝑚 ∈ (0...(♯‘𝑦)) → (𝑥 = (𝑦 cyclShift 𝑚) → (𝑘 ∈ (0...(♯‘𝑧)) → (𝑦 = (𝑧 cyclShift 𝑘) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))))
28	27	imp41 427	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) ∧ 𝑚 ∈ (0...(♯‘𝑦))) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) ∧ 𝑘 ∈ (0...(♯‘𝑧))) → (𝑦 = (𝑧 cyclShift 𝑘) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛)))
29	28	rexlimdva 3156	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) ∧ 𝑚 ∈ (0...(♯‘𝑦))) ∧ 𝑥 = (𝑦 cyclShift 𝑚)) → (∃𝑘 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑘) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛)))
30	29	rexlimdva2 3158	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) → (∃𝑚 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑚) → (∃𝑘 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑘) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))
31	20, 30	syl7bi 255	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) → (∃𝑚 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑚) → (∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))
32	17, 31	biimtrid 241	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) ∧ 𝑧 ∈ (ClWWalks‘𝐺)) ∧ ((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦))) → (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) → (∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))
33	32	exp31 421	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) → (𝑧 ∈ (ClWWalks‘𝐺) → (((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) → (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) → (∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))))
34	33	com15 101	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛) → (𝑧 ∈ (ClWWalks‘𝐺) → (((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) → (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))))
35	34	impcom 409	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → (((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) → (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛)))))
36	35	3adant1 1131	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → (((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) → (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛)))))
37	36	impcom 409	. . . . . . . . . . . . . . . . . 18 ⊢ ((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) → (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))
38	37	com13 88	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺)) → (∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛) → ((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))
39	38	3impia 1118	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛)) → ((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛)))
40	39	impcom 409	. . . . . . . . . . . . . . 15 ⊢ (((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) ∧ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛))) → ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))
41	13, 14, 40	3jca 1129	. . . . . . . . . . . . . 14 ⊢ (((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) ∧ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛))) → (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛)))
42	4	erclwwlkeq 29271	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ∼ 𝑧 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))
43	42	3adant2 1132	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ∼ 𝑧 ↔ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑥 = (𝑧 cyclShift 𝑛))))
44	41, 43	syl5ibrcom 246	. . . . . . . . . . . . 13 ⊢ (((((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) ∧ (𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛))) ∧ (𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛))) → ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → 𝑥 ∼ 𝑧))
45	44	exp31 421	. . . . . . . . . . . 12 ⊢ (((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) → ((𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛)) → ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → 𝑥 ∼ 𝑧))))
46	45	com24 95	. . . . . . . . . . 11 ⊢ (((♯‘𝑦) = (♯‘𝑧) ∧ (♯‘𝑥) = (♯‘𝑦)) → ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛)) → ((𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → 𝑥 ∼ 𝑧))))
47	46	ex 414	. . . . . . . . . 10 ⊢ ((♯‘𝑦) = (♯‘𝑧) → ((♯‘𝑥) = (♯‘𝑦) → ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛)) → ((𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → 𝑥 ∼ 𝑧)))))
48	47	com4t 93	. . . . . . . . 9 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → ((𝑥 ∈ (ClWWalks‘𝐺) ∧ 𝑦 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑦))𝑥 = (𝑦 cyclShift 𝑛)) → ((♯‘𝑦) = (♯‘𝑧) → ((♯‘𝑥) = (♯‘𝑦) → ((𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → 𝑥 ∼ 𝑧)))))
49	12, 48	sylbid 239	. . . . . . . 8 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ∼ 𝑦 → ((♯‘𝑦) = (♯‘𝑧) → ((♯‘𝑥) = (♯‘𝑦) → ((𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → 𝑥 ∼ 𝑧)))))
50	49	com25 99	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → ((𝑦 ∈ (ClWWalks‘𝐺) ∧ 𝑧 ∈ (ClWWalks‘𝐺) ∧ ∃𝑛 ∈ (0...(♯‘𝑧))𝑦 = (𝑧 cyclShift 𝑛)) → ((♯‘𝑦) = (♯‘𝑧) → ((♯‘𝑥) = (♯‘𝑦) → (𝑥 ∼ 𝑦 → 𝑥 ∼ 𝑧)))))
51	10, 50	sylbid 239	. . . . . 6 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑦 ∼ 𝑧 → ((♯‘𝑦) = (♯‘𝑧) → ((♯‘𝑥) = (♯‘𝑦) → (𝑥 ∼ 𝑦 → 𝑥 ∼ 𝑧)))))
52	8, 51	mpdd 43	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑦 ∼ 𝑧 → ((♯‘𝑥) = (♯‘𝑦) → (𝑥 ∼ 𝑦 → 𝑥 ∼ 𝑧))))
53	52	com24 95	. . . 4 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ∼ 𝑦 → ((♯‘𝑥) = (♯‘𝑦) → (𝑦 ∼ 𝑧 → 𝑥 ∼ 𝑧))))
54	6, 53	mpdd 43	. . 3 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ∼ 𝑦 → (𝑦 ∼ 𝑧 → 𝑥 ∼ 𝑧)))
55	54	impd 412	. 2 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → ((𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧) → 𝑥 ∼ 𝑧))
56	1, 2, 3, 55	mp3an 1462	1 ⊢ ((𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧) → 𝑥 ∼ 𝑧)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∃wrex 3071 Vcvv 3475 ∅c0 4323 class class class wbr 5149 {copab 5211 ‘cfv 6544 (class class class)co 7409 0cc0 11110 ...cfz 13484 ♯chash 14290 Word cword 14464 cyclShift ccsh 14738 Vtxcvtx 28256 ClWWalkscclwwlk 29234

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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-fz 13485 df-fzo 13628 df-fl 13757 df-mod 13835 df-hash 14291 df-word 14465 df-concat 14521 df-substr 14591 df-pfx 14621 df-csh 14739 df-clwwlk 29235

This theorem is referenced by: erclwwlk 29276

W3C validator