Theorem uspgr2wlkeq 29935

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 1111	. . 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 29923	. . . 4 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))
4	3	3expa 1134	. . 3 ⊢ (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))
5	4	3adant1 1146	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))
6		fzofzp1 13792	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (0..^𝑁) → (𝑥 + 1) ∈ (0...𝑁))
7	6	adantl 486	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (𝑥 + 1) ∈ (0...𝑁))
8		fveq2 6882	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑥 + 1) → ((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐴)‘(𝑥 + 1)))
9		fveq2 6882	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑥 + 1) → ((2nd ‘𝐵)‘𝑦) = ((2nd ‘𝐵)‘(𝑥 + 1)))
10	8, 9	eqeq12d 2785	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥 + 1) → (((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ↔ ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
11	10	adantl 486	. . . . . . . . . . 11 ⊢ (((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) ∧ 𝑦 = (𝑥 + 1)) → (((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ↔ ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
12	7, 11	rspcdv 3582	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
13	12	impancom 456	. . . . . . . . 9 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → (𝑥 ∈ (0..^𝑁) → ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
14	13	ralrimiv 3162	. . . . . . . 8 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑥 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1)))
15		fvoveq1 7434	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐴)‘(𝑥 + 1)))
16		fvoveq1 7434	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ((2nd ‘𝐵)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1)))
17	15, 16	eqeq12d 2785	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) ↔ ((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1))))
18	17	cbvralvw 3249	. . . . . . . 8 ⊢ (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) ↔ ∀𝑥 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑥 + 1)) = ((2nd ‘𝐵)‘(𝑥 + 1)))
19	14, 18	sylibr 237	. . . . . . 7 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)))
20		fzossfz 13706	. . . . . . . . . 10 ⊢ (0..^𝑁) ⊆ (0...𝑁)
21		ssralv 4014	. . . . . . . . . 10 ⊢ ((0..^𝑁) ⊆ (0...𝑁) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)))
22	20, 21	mp1i 14	. . . . . . . . 9 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)))
23		r19.26 3131	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ (0..^𝑁)(((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) ↔ (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))))
24		preq12 4706	. . . . . . . . . . . . 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 3185	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁)(((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
27	23, 26	biimtrrid 246	. . . . . . . . . 10 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → ((∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
28	27	expd 420	. . . . . . . . 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 48	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → (∀𝑦 ∈ (0..^𝑁)((2nd ‘𝐴)‘(𝑦 + 1)) = ((2nd ‘𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})))
30	29	imp 411	. . . . . . 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 16	. . . . . 6 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})
32	31	ex 417	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
33		uspgrupgr 29468	. . . . . . . 8 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
34		eqid 2769	. . . . . . . . . 10 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
35		eqid 2769	. . . . . . . . . 10 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
36		eqid 2769	. . . . . . . . . 10 ⊢ (1st ‘𝐴) = (1st ‘𝐴)
37		eqid 2769	. . . . . . . . . 10 ⊢ (2nd ‘𝐴) = (2nd ‘𝐴)
38	34, 35, 36, 37	upgrwlkcompim 29932	. . . . . . . . 9 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐴 ∈ (Walks‘𝐺)) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}))
39	38	ex 417	. . . . . . . 8 ⊢ (𝐺 ∈ UPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))})))
40	33, 39	syl 18	. . . . . . 7 ⊢ (𝐺 ∈ USPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))})))
41		eqid 2769	. . . . . . . . . 10 ⊢ (1st ‘𝐵) = (1st ‘𝐵)
42		eqid 2769	. . . . . . . . . 10 ⊢ (2nd ‘𝐵) = (2nd ‘𝐵)
43	34, 35, 41, 42	upgrwlkcompim 29932	. . . . . . . . 9 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐵 ∈ (Walks‘𝐺)) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
44	43	ex 417	. . . . . . . 8 ⊢ (𝐺 ∈ UPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})))
45	33, 44	syl 18	. . . . . . 7 ⊢ (𝐺 ∈ USPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))})))
46		oveq2 7419	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘(1st ‘𝐵)) = 𝑁 → (0..^(♯‘(1st ‘𝐵))) = (0..^𝑁))
47	46	eqcoms 2777	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (0..^(♯‘(1st ‘𝐵))) = (0..^𝑁))
48	47	raleqdv 3329	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
49		oveq2 7419	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘(1st ‘𝐴)) = 𝑁 → (0..^(♯‘(1st ‘𝐴))) = (0..^𝑁))
50	49	eqcoms 2777	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (0..^(♯‘(1st ‘𝐴))) = (0..^𝑁))
51	50	raleqdv 3329	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (∀𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}))
52	48, 51	bi2anan9r 650	. . . . . . . . . . . . . . . 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 3131	. . . . . . . . . . . . . . . . 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 2781	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))}))
55		eqeq2 2781	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ({((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
56	55	eqcoms 2777	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
57	56	biimpd 232	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
58	54, 57	biimtrdi 256	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))
59	58	com13 89	. . . . . . . . . . . . . . . . . . 19 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} → ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))
60	59	imp 411	. . . . . . . . . . . . . . . . . 18 ⊢ ((((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = {((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))}) → ({((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
61	60	ral2imi 3110	. . . . . . . . . . . . . . . . 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 238	. . . . . . . . . . . . . . . 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	biimtrdi 256	. . . . . . . . . . . . . . 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 33	. . . . . . . . . . . . . 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 417	. . . . . . . . . . . . 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 1151	. . . . . . . . . . . 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 33	. . . . . . . . . . 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 1151	. . . . . . . . . 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 411	. . . . . . . . 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 420	. . . . . . . 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 619	. . . . . 6 ⊢ (𝐺 ∈ USPGraph → ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (♯‘(1st ‘𝐴)) → (𝑁 = (♯‘(1st ‘𝐵)) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)))))))
73	72	3imp1 1364	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd ‘𝐴)‘𝑦), ((2nd ‘𝐴)‘(𝑦 + 1))} = {((2nd ‘𝐵)‘𝑦), ((2nd ‘𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦))))
74		eqcom 2776	. . . . . . 7 ⊢ (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) ↔ ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)))
75	35	uspgrf1oedg 29463	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺))
76		f1of1 6820	. . . . . . . . . . . 12 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
77	75, 76	syl 18	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
78		eqidd 2770	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺) = (iEdg‘𝐺))
79		eqidd 2770	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → dom (iEdg‘𝐺) = dom (iEdg‘𝐺))
80		edgval 29339	. . . . . . . . . . . . . 14 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
81	80	eqcomi 2778	. . . . . . . . . . . . 13 ⊢ ran (iEdg‘𝐺) = (Edg‘𝐺)
82	81	a1i 11	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USPGraph → ran (iEdg‘𝐺) = (Edg‘𝐺))
83	78, 79, 82	f1eq123d 6813	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USPGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺)))
84	77, 83	mpbird 260	. . . . . . . . . 10 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
85	84	3ad2ant1 1149	. . . . . . . . 9 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
86	85	adantr 485	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
87	34, 35, 36, 37	wlkelwrd 29922	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ (Walks‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐴):(0...(♯‘(1st ‘𝐴)))⟶(Vtx‘𝐺)))
88	34, 35, 41, 42	wlkelwrd 29922	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ (Walks‘𝐺) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd ‘𝐵):(0...(♯‘(1st ‘𝐵)))⟶(Vtx‘𝐺)))
89		oveq2 7419	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (0..^𝑁) = (0..^(♯‘(1st ‘𝐴))))
90	89	eleq2d 2855	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))))
91		wrdsymbcl 14563	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(♯‘(1st ‘𝐴)))) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))
92	91	expcom 418	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 ∈ (0..^(♯‘(1st ‘𝐴))) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
93	90, 92	biimtrdi 256	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 = (♯‘(1st ‘𝐴)) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
94	93	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
95	94	imp 411	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
96	95	com12 33	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
97	96	adantl 486	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st ‘𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
98		oveq2 7419	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (0..^𝑁) = (0..^(♯‘(1st ‘𝐵))))
99	98	eleq2d 2855	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))))
100		wrdsymbcl 14563	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(♯‘(1st ‘𝐵)))) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))
101	100	expcom 418	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 ∈ (0..^(♯‘(1st ‘𝐵))) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
102	99, 101	biimtrdi 256	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
103	102	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
104	103	imp 411	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
105	104	com12 33	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
106	105	adantr 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st ‘𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
107	97, 106	jcad 521	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st ‘𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
108	107	ex 417	. . . . . . . . . . . . . . . . . . 19 ⊢ ((1st ‘𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st ‘𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
109	108	adantr 485	. . . . . . . . . . . . . . . . . 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 33	. . . . . . . . . . . . . . . . 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 485	. . . . . . . . . . . . . . . 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 411	. . . . . . . . . . . . . . 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 607	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
114	113	expd 420	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → ((𝑁 = (♯‘(1st ‘𝐴)) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
115	114	expd 420	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (♯‘(1st ‘𝐴)) → (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))))
116	115	imp 411	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
117	116	3adant1 1146	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝑁 = (♯‘(1st ‘𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
118	117	imp 411	. . . . . . . . 9 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
119	118	imp 411	. . . . . . . 8 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st ‘𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st ‘𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
120		f1veqaeq 7255	. . . . . . . 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 697	. . . . . . 7 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) → ((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
122	74, 121	biimtrid 245	. . . . . 6 ⊢ ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) → ((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
123	122	ralimdva 3183	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st ‘𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st ‘𝐴)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
124	32, 73, 123	3syld 61	. . . 4 ⊢ (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) ∧ 𝑁 = (♯‘(1st ‘𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
125	124	expimpd 458	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦)))
126	125	pm4.71d 570	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ↔ ((𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st ‘𝐴)‘𝑦) = ((1st ‘𝐵)‘𝑦))))
127	2, 5, 126	3bitr4d 314	1 ⊢ ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st ‘𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st ‘𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd ‘𝐴)‘𝑦) = ((2nd ‘𝐵)‘𝑦))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  ∀wral 3085   ⊆ wss 3913  {cpr 4596  dom cdm 5662  ran crn 5663  ⟶wf 6533  –1-1→wf1 6534  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7411  1^st c1st 7983  2^nd c2nd 7984  0cc0 11099  1c1 11100   + caddc 11102  ...cfz 13534  ..^cfzo 13681  ♯chash 14365  Word cword 14549  Vtxcvtx 29286  iEdgciedg 29287  Edgcedg 29337  UPGraphcupgr 29370  USPGraphcuspgr 29438  Walkscwlks 29886

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11155  ax-resscn 11156  ax-1cn 11157  ax-icn 11158  ax-addcl 11159  ax-addrcl 11160  ax-mulcl 11161  ax-mulrcl 11162  ax-mulcom 11163  ax-addass 11164  ax-mulass 11165  ax-distr 11166  ax-i2m1 11167  ax-1ne0 11168  ax-1rid 11169  ax-rnegex 11170  ax-rrecex 11171  ax-cnre 11172  ax-pre-lttri 11173  ax-pre-lttrn 11174  ax-pre-ltadd 11175  ax-pre-mulgt0 11176

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ifp 1077  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7862  df-1st 7985  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8452  df-2o 8453  df-oadd 8456  df-er 8693  df-map 8825  df-pm 8826  df-en 8943  df-dom 8944  df-sdom 8945  df-fin 8946  df-dju 9886  df-card 9924  df-pnf 11244  df-mnf 11245  df-xr 11246  df-ltxr 11247  df-le 11248  df-sub 11442  df-neg 11443  df-nn 12233  df-2 12302  df-n0 12504  df-xnn0 12577  df-z 12591  df-uz 12862  df-fz 13535  df-fzo 13682  df-hash 14366  df-word 14550  df-edg 29338  df-uhgr 29348  df-upgr 29372  df-uspgr 29440  df-wlks 29889

This theorem is referenced by:  uspgr2wlkeq2  29936  clwlkclwwlkf1  30301