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

Theorem uspgr2wlkeq 26598
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.
StepHypRef Expression
1 3anan32 1068 . . 3 ((𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ↔ ((𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
21a1i 11 . 2 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → ((𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ↔ ((𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦))))
3 wlkeq 26585 . . . 4 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺) ∧ 𝑁 = (#‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
433expa 1284 . . 3 (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
543adant1 1099 . 2 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
6 fzofzp1 12605 . . . . . . . . . . . 12 (𝑥 ∈ (0..^𝑁) → (𝑥 + 1) ∈ (0...𝑁))
76adantl 481 . . . . . . . . . . 11 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (𝑥 + 1) ∈ (0...𝑁))
8 fveq2 6229 . . . . . . . . . . . . 13 (𝑦 = (𝑥 + 1) → ((2nd𝐴)‘𝑦) = ((2nd𝐴)‘(𝑥 + 1)))
9 fveq2 6229 . . . . . . . . . . . . 13 (𝑦 = (𝑥 + 1) → ((2nd𝐵)‘𝑦) = ((2nd𝐵)‘(𝑥 + 1)))
108, 9eqeq12d 2666 . . . . . . . . . . . 12 (𝑦 = (𝑥 + 1) → (((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ↔ ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1110adantl 481 . . . . . . . . . . 11 (((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) ∧ 𝑦 = (𝑥 + 1)) → (((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ↔ ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
127, 11rspcdv 3343 . . . . . . . . . 10 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1312impancom 455 . . . . . . . . 9 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → (𝑥 ∈ (0..^𝑁) → ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1413ralrimiv 2994 . . . . . . . 8 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑥 ∈ (0..^𝑁)((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1)))
15 oveq1 6697 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝑦 + 1) = (𝑥 + 1))
1615fveq2d 6233 . . . . . . . . . 10 (𝑦 = 𝑥 → ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐴)‘(𝑥 + 1)))
1715fveq2d 6233 . . . . . . . . . 10 (𝑦 = 𝑥 → ((2nd𝐵)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑥 + 1)))
1816, 17eqeq12d 2666 . . . . . . . . 9 (𝑦 = 𝑥 → (((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) ↔ ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1918cbvralv 3201 . . . . . . . 8 (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) ↔ ∀𝑥 ∈ (0..^𝑁)((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1)))
2014, 19sylibr 224 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)))
21 fzossfz 12527 . . . . . . . . . 10 (0..^𝑁) ⊆ (0...𝑁)
22 ssralv 3699 . . . . . . . . . 10 ((0..^𝑁) ⊆ (0...𝑁) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)))
2321, 22mp1i 13 . . . . . . . . 9 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)))
24 r19.26 3093 . . . . . . . . . . 11 (∀𝑦 ∈ (0..^𝑁)(((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) ↔ (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))))
25 preq12 4302 . . . . . . . . . . . . 13 ((((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})
2625a1i 11 . . . . . . . . . . . 12 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → ((((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
2726ralimdv 2992 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁)(((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
2824, 27syl5bir 233 . . . . . . . . . 10 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → ((∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
2928expd 451 . . . . . . . . 9 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
3023, 29syld 47 . . . . . . . 8 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
3130imp 444 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
3220, 31mpd 15 . . . . . 6 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})
3332ex 449 . . . . 5 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
34 uspgrupgr 26116 . . . . . . . 8 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
35 eqid 2651 . . . . . . . . . 10 (Vtx‘𝐺) = (Vtx‘𝐺)
36 eqid 2651 . . . . . . . . . 10 (iEdg‘𝐺) = (iEdg‘𝐺)
37 eqid 2651 . . . . . . . . . 10 (1st𝐴) = (1st𝐴)
38 eqid 2651 . . . . . . . . . 10 (2nd𝐴) = (2nd𝐴)
3935, 36, 37, 38upgrwlkcompim 26595 . . . . . . . . 9 ((𝐺 ∈ UPGraph ∧ 𝐴 ∈ (Walks‘𝐺)) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(#‘(1st𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(#‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}))
4039ex 449 . . . . . . . 8 (𝐺 ∈ UPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(#‘(1st𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(#‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))})))
4134, 40syl 17 . . . . . . 7 (𝐺 ∈ USPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(#‘(1st𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(#‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))})))
42 eqid 2651 . . . . . . . . . 10 (1st𝐵) = (1st𝐵)
43 eqid 2651 . . . . . . . . . 10 (2nd𝐵) = (2nd𝐵)
4435, 36, 42, 43upgrwlkcompim 26595 . . . . . . . . 9 ((𝐺 ∈ UPGraph ∧ 𝐵 ∈ (Walks‘𝐺)) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(#‘(1st𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(#‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
4544ex 449 . . . . . . . 8 (𝐺 ∈ UPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(#‘(1st𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(#‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
4634, 45syl 17 . . . . . . 7 (𝐺 ∈ USPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(#‘(1st𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(#‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
47 oveq2 6698 . . . . . . . . . . . . . . . . . . 19 ((#‘(1st𝐵)) = 𝑁 → (0..^(#‘(1st𝐵))) = (0..^𝑁))
4847eqcoms 2659 . . . . . . . . . . . . . . . . . 18 (𝑁 = (#‘(1st𝐵)) → (0..^(#‘(1st𝐵))) = (0..^𝑁))
4948raleqdv 3174 . . . . . . . . . . . . . . . . 17 (𝑁 = (#‘(1st𝐵)) → (∀𝑦 ∈ (0..^(#‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
50 oveq2 6698 . . . . . . . . . . . . . . . . . . 19 ((#‘(1st𝐴)) = 𝑁 → (0..^(#‘(1st𝐴))) = (0..^𝑁))
5150eqcoms 2659 . . . . . . . . . . . . . . . . . 18 (𝑁 = (#‘(1st𝐴)) → (0..^(#‘(1st𝐴))) = (0..^𝑁))
5251raleqdv 3174 . . . . . . . . . . . . . . . . 17 (𝑁 = (#‘(1st𝐴)) → (∀𝑦 ∈ (0..^(#‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}))
5349, 52bi2anan9r 936 . . . . . . . . . . . . . . . 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))})))
54 r19.26 3093 . . . . . . . . . . . . . . . . 17 (∀𝑦 ∈ (0..^𝑁)(((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}) ↔ (∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ∧ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}))
55 eqeq2 2662 . . . . . . . . . . . . . . . . . . . . 21 ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
56 eqeq2 2662 . . . . . . . . . . . . . . . . . . . . . . 23 ({((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
5756eqcoms 2659 . . . . . . . . . . . . . . . . . . . . . 22 (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
5857biimpd 219 . . . . . . . . . . . . . . . . . . . . 21 (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
5955, 58syl6bi 243 . . . . . . . . . . . . . . . . . . . 20 ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)))))
6059com13 88 . . . . . . . . . . . . . . . . . . 19 (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} → ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)))))
6160imp 444 . . . . . . . . . . . . . . . . . 18 ((((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}) → ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
6261ral2imi 2976 . . . . . . . . . . . . . . . . 17 (∀𝑦 ∈ (0..^𝑁)(((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}) → (∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
6354, 62sylbir 225 . . . . . . . . . . . . . . . 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𝐴)‘𝑦))))
6453, 63syl6bi 243 . . . . . . . . . . . . . . 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𝐴)‘𝑦)))))
6564com12 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𝐴)‘𝑦)))))
6665ex 449 . . . . . . . . . . . . 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𝐴)‘𝑦))))))
67663ad2ant3 1104 . . . . . . . . . . . 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𝐴)‘𝑦))))))
6867com12 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𝐴)‘𝑦))))))
69683ad2ant3 1104 . . . . . . . . . 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𝐴)‘𝑦))))))
7069imp 444 . . . . . . . . 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𝐴)‘𝑦)))))
7170expd 451 . . . . . . . 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𝐴)‘𝑦))))))
7271a1i 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𝐴)‘𝑦)))))))
7341, 46, 72syl2and 499 . . . . . 6 (𝐺 ∈ USPGraph → ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (#‘(1st𝐴)) → (𝑁 = (#‘(1st𝐵)) → (∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)))))))
74733imp1 1302 . . . . 5 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
75 eqcom 2658 . . . . . . 7 (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) ↔ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)))
7636uspgrf1oedg 26113 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺))
77 f1of1 6174 . . . . . . . . . . . 12 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
7876, 77syl 17 . . . . . . . . . . 11 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
79 eqidd 2652 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → (iEdg‘𝐺) = (iEdg‘𝐺))
80 eqidd 2652 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → dom (iEdg‘𝐺) = dom (iEdg‘𝐺))
81 edgval 25986 . . . . . . . . . . . . . 14 (Edg‘𝐺) = ran (iEdg‘𝐺)
8281eqcomi 2660 . . . . . . . . . . . . 13 ran (iEdg‘𝐺) = (Edg‘𝐺)
8382a1i 11 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → ran (iEdg‘𝐺) = (Edg‘𝐺))
8479, 80, 83f1eq123d 6169 . . . . . . . . . . 11 (𝐺 ∈ USPGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺)))
8578, 84mpbird 247 . . . . . . . . . 10 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
86853ad2ant1 1102 . . . . . . . . 9 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
8786adantr 480 . . . . . . . 8 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
8835, 36, 37, 38wlkelwrd 26584 . . . . . . . . . . . . . . 15 (𝐴 ∈ (Walks‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(#‘(1st𝐴)))⟶(Vtx‘𝐺)))
8935, 36, 42, 43wlkelwrd 26584 . . . . . . . . . . . . . . 15 (𝐵 ∈ (Walks‘𝐺) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(#‘(1st𝐵)))⟶(Vtx‘𝐺)))
90 oveq2 6698 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑁 = (#‘(1st𝐴)) → (0..^𝑁) = (0..^(#‘(1st𝐴))))
9190eleq2d 2716 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑁 = (#‘(1st𝐴)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(#‘(1st𝐴)))))
92 wrdsymbcl 13350 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(#‘(1st𝐴)))) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))
9392expcom 450 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑦 ∈ (0..^(#‘(1st𝐴))) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
9491, 93syl6bi 243 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑁 = (#‘(1st𝐴)) → (𝑦 ∈ (0..^𝑁) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
9594adantr 480 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
9695imp 444 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
9796com12 32 . . . . . . . . . . . . . . . . . . . . . 22 ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
9897adantl 481 . . . . . . . . . . . . . . . . . . . . 21 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
99 oveq2 6698 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑁 = (#‘(1st𝐵)) → (0..^𝑁) = (0..^(#‘(1st𝐵))))
10099eleq2d 2716 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑁 = (#‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(#‘(1st𝐵)))))
101 wrdsymbcl 13350 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(#‘(1st𝐵)))) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))
102101expcom 450 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑦 ∈ (0..^(#‘(1st𝐵))) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
103100, 102syl6bi 243 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑁 = (#‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
104103adantl 481 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
105104imp 444 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
106105com12 32 . . . . . . . . . . . . . . . . . . . . . 22 ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
107106adantr 480 . . . . . . . . . . . . . . . . . . . . 21 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
10898, 107jcad 554 . . . . . . . . . . . . . . . . . . . 20 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
109108ex 449 . . . . . . . . . . . . . . . . . . 19 ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
110109adantr 480 . . . . . . . . . . . . . . . . . 18 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(#‘(1st𝐵)))⟶(Vtx‘𝐺)) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
111110com12 32 . . . . . . . . . . . . . . . . 17 ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(#‘(1st𝐵)))⟶(Vtx‘𝐺)) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
112111adantr 480 . . . . . . . . . . . . . . . 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‘𝐺)))))
113112imp 444 . . . . . . . . . . . . . . 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‘𝐺))))
11488, 89, 113syl2an 493 . . . . . . . . . . . . . 14 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
115114expd 451 . . . . . . . . . . . . 13 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → ((𝑁 = (#‘(1st𝐴)) ∧ 𝑁 = (#‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
116115expd 451 . . . . . . . . . . . 12 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (#‘(1st𝐴)) → (𝑁 = (#‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))))
117116imp 444 . . . . . . . . . . 11 (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → (𝑁 = (#‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
1181173adant1 1099 . . . . . . . . . 10 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → (𝑁 = (#‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
119118imp 444 . . . . . . . . 9 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
120119imp 444 . . . . . . . 8 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
121 f1veqaeq 6554 . . . . . . . 8 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺) ∧ (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))) → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) → ((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
12287, 120, 121syl2an2r 893 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) → ((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
12375, 122syl5bi 232 . . . . . 6 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) → ((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
124123ralimdva 2991 . . . . 5 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
12533, 74, 1243syld 60 . . . 4 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) ∧ 𝑁 = (#‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
126125expimpd 628 . . 3 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → ((𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
127126pm4.71d 667 . 2 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → ((𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ↔ ((𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦))))
1282, 5, 1273bitr4d 300 1 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (#‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1054   = wceq 1523  wcel 2030  wral 2941  wss 3607  {cpr 4212  dom cdm 5143  ran crn 5144  wf 5922  1-1wf1 5923  1-1-ontowf1o 5925  cfv 5926  (class class class)co 6690  1st c1st 7208  2nd c2nd 7209  0cc0 9974  1c1 9975   + caddc 9977  ...cfz 12364  ..^cfzo 12504  #chash 13157  Word cword 13323  Vtxcvtx 25919  iEdgciedg 25920  Edgcedg 25984  UPGraphcupgr 26020  USPGraphcuspgr 26088  Walkscwlks 26548
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-ifp 1033  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-2o 7606  df-oadd 7609  df-er 7787  df-map 7901  df-pm 7902  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-card 8803  df-cda 9028  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-nn 11059  df-2 11117  df-n0 11331  df-xnn0 11402  df-z 11416  df-uz 11726  df-fz 12365  df-fzo 12505  df-hash 13158  df-word 13331  df-edg 25985  df-uhgr 25998  df-upgr 26022  df-uspgr 26090  df-wlks 26551
This theorem is referenced by:  uspgr2wlkeq2  26599  clwlksf1clwwlk  27056
  Copyright terms: Public domain W3C validator