Theorem uspgr2wlkeq 27429

Description: Conditions for two walks within the same simple pseudograph being the same. It is sufficient that the vertices (in the same order) are identical. (Contributed by AV, 3-Jul-2018.) (Revised by AV, 14-Apr-2021.)

Assertion

Ref	Expression
uspgr2wlkeq	⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))

Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑦,𝐺   𝑦,𝑁

Proof of Theorem uspgr2wlkeq

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		3anan32 1093	. . 3 ⊢ ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ↔ ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
2	1	a1i 11	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ↔ ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦))))
3		wlkeq 27417	. . . 4 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))
4	3	3expa 1114	. . 3 ⊢ (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))
5	4	3adant1 1126	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))
6		fzofzp1 13137	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (0..^𝑁) → (𝑥 + 1) ∈ (0...𝑁))
7	6	adantl 484	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (𝑥 + 1) ∈ (0...𝑁))
8		fveq2 6672	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑥 + 1) → ((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐴)‘(𝑥 + 1)))
9		fveq2 6672	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑥 + 1) → ((2nd ‘𝐵)‘𝑦) = ((2nd ‘𝐵)‘(𝑥 + 1)))
10	8, 9	eqeq12d 2839	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥 + 1) → (((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ↔ ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
11	10	adantl 484	. . . . . . . . . . 11 ⊢ (((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) ∧ 𝑦 = (𝑥 + 1)) → (((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ↔ ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
12	7, 11	rspcdv 3617	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
13	12	impancom 454	. . . . . . . . 9 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → (𝑥 ∈ (0..^𝑁) → ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
14	13	ralrimiv 3183	. . . . . . . 8 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑥 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1)))
15		fvoveq1 7181	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐴)‘(𝑥 + 1)))
16		fvoveq1 7181	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ((2nd ‘𝐵)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1)))
17	15, 16	eqeq12d 2839	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) ↔ ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
18	17	cbvralvw 3451	. . . . . . . 8 ⊢ (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) ↔ ∀𝑥 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1)))
19	14, 18	sylibr 236	. . . . . . 7 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)))
20		fzossfz 13059	. . . . . . . . . 10 ⊢ (0..^𝑁) ⊆ (0...𝑁)
21		ssralv 4035	. . . . . . . . . 10 ⊢ ((0..^𝑁) ⊆ (0...𝑁) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)))
22	20, 21	mp1i 13	. . . . . . . . 9 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)))
23		r19.26 3172	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ (0..^𝑁)(((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) ↔ (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))))
24		preq12 4673	. . . . . . . . . . . . 13 ⊢ ((((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) → {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})
25	24	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → ((((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) → {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
26	25	ralimdv 3180	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁)(((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
27	23, 26	syl5bir 245	. . . . . . . . . 10 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → ((∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
28	27	expd 418	. . . . . . . . 9 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})))
29	22, 28	syld 47	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})))
30	29	imp 409	. . . . . . 7 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
31	19, 30	mpd 15	. . . . . 6 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})
32	31	ex 415	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
33		uspgrupgr 26963	. . . . . . . 8 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
34		eqid 2823	. . . . . . . . . 10 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
35		eqid 2823	. . . . . . . . . 10 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
36		eqid 2823	. . . . . . . . . 10 ⊢ (1st ‘𝐴) = (1st ‘𝐴)
37		eqid 2823	. . . . . . . . . 10 ⊢ (2nd ‘𝐴) = (2nd ‘𝐴)
38	34, 35, 36, 37	upgrwlkcompim 27426	. . . . . . . . 9 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐴 ∈ (Walks‘𝐺)) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}))
39	38	ex 415	. . . . . . . 8 ⊢ (𝐺 ∈ UPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))})))
40	33, 39	syl 17	. . . . . . 7 ⊢ (𝐺 ∈ USPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))})))
41		eqid 2823	. . . . . . . . . 10 ⊢ (1st ‘𝐵) = (1st ‘𝐵)
42		eqid 2823	. . . . . . . . . 10 ⊢ (2nd ‘𝐵) = (2nd ‘𝐵)
43	34, 35, 41, 42	upgrwlkcompim 27426	. . . . . . . . 9 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐵 ∈ (Walks‘𝐺)) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
44	43	ex 415	. . . . . . . 8 ⊢ (𝐺 ∈ UPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})))
45	33, 44	syl 17	. . . . . . 7 ⊢ (𝐺 ∈ USPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})))
46		oveq2 7166	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘(1st ‘𝐵)) = 𝑁 → (0..^(♯‘(1st ‘𝐵))) = (0..^𝑁))
47	46	eqcoms 2831	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (0..^(♯‘(1st ‘𝐵))) = (0..^𝑁))
48	47	raleqdv 3417	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
49		oveq2 7166	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘(1st ‘𝐴)) = 𝑁 → (0..^(♯‘(1st ‘𝐴))) = (0..^𝑁))
50	49	eqcoms 2831	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (0..^(♯‘(1st ‘𝐴))) = (0..^𝑁))
51	50	raleqdv 3417	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}))
52	48, 51	bi2anan9r 638	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → ((∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) ↔ (∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))})))
53		r19.26 3172	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑦 ∈ (0..^𝑁)(((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) ↔ (∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}))
54		eqeq2 2835	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
55		eqeq2 2835	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ({((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
56	55	eqcoms 2831	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
57	56	biimpd 231	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
58	54, 57	syl6bi 255	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))
59	58	com13 88	. . . . . . . . . . . . . . . . . . 19 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} → ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))
60	59	imp 409	. . . . . . . . . . . . . . . . . 18 ⊢ ((((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) → ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
61	60	ral2imi 3158	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑦 ∈ (0..^𝑁)(((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
62	53, 61	sylbir 237	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
63	52, 62	syl6bi 255	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → ((∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))
64	63	com12 32	. . . . . . . . . . . . . 14 ⊢ ((∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))
65	64	ex 415	. . . . . . . . . . . . 13 ⊢ (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))))
66	65	3ad2ant3 1131	. . . . . . . . . . . 12 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}) → (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))))
67	66	com12 32	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} → (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}) → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))))
68	67	3ad2ant3 1131	. . . . . . . . . 10 ⊢ (((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) → (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}) → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))))
69	68	imp 409	. . . . . . . . 9 ⊢ ((((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) ∧ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})) → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))
70	69	expd 418	. . . . . . . 8 ⊢ ((((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) ∧ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})) → (𝑁 = (♯‘(1st ‘𝐴)) → (𝑁 = (♯‘(1st ‘𝐵)) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))))
71	70	a1i 11	. . . . . . 7 ⊢ (𝐺 ∈ USPGraph → ((((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) ∧ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})) → (𝑁 = (♯‘(1st ‘𝐴)) → (𝑁 = (♯‘(1st ‘𝐵)) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))))
72	40, 45, 71	syl2and 609	. . . . . 6 ⊢ (𝐺 ∈ USPGraph → ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (♯‘(1st ‘𝐴)) → (𝑁 = (♯‘(1st ‘𝐵)) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))))
73	72	3imp1 1343	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
74		eqcom 2830	. . . . . . 7 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) ↔ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)))
75	35	uspgrf1oedg 26960	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺))
76		f1of1 6616	. . . . . . . . . . . 12 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
77	75, 76	syl 17	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
78		eqidd 2824	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺) = (iEdg‘𝐺))
79		eqidd 2824	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → dom (iEdg‘𝐺) = dom (iEdg‘𝐺))
80		edgval 26836	. . . . . . . . . . . . . 14 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
81	80	eqcomi 2832	. . . . . . . . . . . . 13 ⊢ ran (iEdg‘𝐺) = (Edg‘𝐺)
82	81	a1i 11	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → ran (iEdg‘𝐺) = (Edg‘𝐺))
83	78, 79, 82	f1eq123d 6610	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USPGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺)))
84	77, 83	mpbird 259	. . . . . . . . . 10 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
85	84	3ad2ant1 1129	. . . . . . . . 9 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
86	85	adantr 483	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
87	34, 35, 36, 37	wlkelwrd 27416	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ (Walks‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺)))
88	34, 35, 41, 42	wlkelwrd 27416	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ (Walks‘𝐺) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺)))
89		oveq2 7166	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (0..^𝑁) = (0..^(♯‘(1st ‘𝐴))))
90	89	eleq2d 2900	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))))
91		wrdsymbcl 13878	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))
92	91	expcom 416	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 ∈ (0..^(♯‘(1st ‘𝐴))) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
93	90, 92	syl6bi 255	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
94	93	adantr 483	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
95	94	imp 409	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
96	95	com12 32	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
97	96	adantl 484	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st ‘𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
98		oveq2 7166	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (0..^𝑁) = (0..^(♯‘(1st ‘𝐵))))
99	98	eleq2d 2900	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))))
100		wrdsymbcl 13878	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))
101	100	expcom 416	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 ∈ (0..^(♯‘(1st ‘𝐵))) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
102	99, 101	syl6bi 255	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
103	102	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
104	103	imp 409	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
105	104	com12 32	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
106	105	adantr 483	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st ‘𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
107	97, 106	jcad 515	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st ‘𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
108	107	ex 415	. . . . . . . . . . . . . . . . . . 19 ⊢ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
109	108	adantr 483	. . . . . . . . . . . . . . . . . 18 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺)) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
110	109	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
111	110	adantr 483	. . . . . . . . . . . . . . . 16 ⊢ (((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺)) → (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
112	111	imp 409	. . . . . . . . . . . . . . 15 ⊢ ((((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺)) ∧ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺))) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
113	87, 88, 112	syl2an 597	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
114	113	expd 418	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
115	114	expd 418	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (♯‘(1st ‘𝐴)) → (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))))
116	115	imp 409	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
117	116	3adant1 1126	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
118	117	imp 409	. . . . . . . . 9 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
119	118	imp 409	. . . . . . . 8 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
120		f1veqaeq 7017	. . . . . . . 8 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺) ∧ (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))) → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) → ((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
121	86, 119, 120	syl2an2r 683	. . . . . . 7 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) → ((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
122	74, 121	syl5bi 244	. . . . . 6 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) → ((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
123	122	ralimdva 3179	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
124	32, 73, 123	3syld 60	. . . 4 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
125	124	expimpd 456	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
126	125	pm4.71d 564	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ↔ ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦))))
127	2, 5, 126	3bitr4d 313	1 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∀wral 3140   ⊆ wss 3938  {cpr 4571  dom cdm 5557  ran crn 5558  ⟶wf 6353  –1-1→wf1 6354  –1-1-onto→wf1o 6356  ‘cfv 6357  (class class class)co 7158  1^st c1st 7689  2^nd c2nd 7690  0cc0 10539  1c1 10540   + caddc 10542  ...cfz 12895  ..^cfzo 13036  ♯chash 13693  Word cword 13864  Vtxcvtx 26783  iEdgciedg 26784  Edgcedg 26834  UPGraphcupgr 26867  USPGraphcuspgr 26935  Walkscwlks 27380

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ifp 1058  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-2o 8105  df-oadd 8108  df-er 8291  df-map 8410  df-pm 8411  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-dju 9332  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-n0 11901  df-xnn0 11971  df-z 11985  df-uz 12247  df-fz 12896  df-fzo 13037  df-hash 13694  df-word 13865  df-edg 26835  df-uhgr 26845  df-upgr 26869  df-uspgr 26937  df-wlks 27383

This theorem is referenced by:  uspgr2wlkeq2  27430  clwlkclwwlkf1  27790