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

Theorem uspgr2wlkeq 26798
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 1109 . . 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 26785 . . . 4 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺) ∧ 𝑁 = (♯‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
433expa 1138 . . 3 (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
543adant1 1151 . 2 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st𝐵)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
6 fzofzp1 12795 . . . . . . . . . . . 12 (𝑥 ∈ (0..^𝑁) → (𝑥 + 1) ∈ (0...𝑁))
76adantl 468 . . . . . . . . . . 11 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (𝑥 + 1) ∈ (0...𝑁))
8 fveq2 6348 . . . . . . . . . . . . 13 (𝑦 = (𝑥 + 1) → ((2nd𝐴)‘𝑦) = ((2nd𝐴)‘(𝑥 + 1)))
9 fveq2 6348 . . . . . . . . . . . . 13 (𝑦 = (𝑥 + 1) → ((2nd𝐵)‘𝑦) = ((2nd𝐵)‘(𝑥 + 1)))
108, 9eqeq12d 2789 . . . . . . . . . . . 12 (𝑦 = (𝑥 + 1) → (((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ↔ ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1110adantl 468 . . . . . . . . . . 11 (((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) ∧ 𝑦 = (𝑥 + 1)) → (((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ↔ ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
127, 11rspcdv 3468 . . . . . . . . . 10 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑥 ∈ (0..^𝑁)) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1312impancom 440 . . . . . . . . 9 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → (𝑥 ∈ (0..^𝑁) → ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1413ralrimiv 3117 . . . . . . . 8 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑥 ∈ (0..^𝑁)((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1)))
15 fvoveq1 6835 . . . . . . . . . 10 (𝑦 = 𝑥 → ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐴)‘(𝑥 + 1)))
16 fvoveq1 6835 . . . . . . . . . 10 (𝑦 = 𝑥 → ((2nd𝐵)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑥 + 1)))
1715, 16eqeq12d 2789 . . . . . . . . 9 (𝑦 = 𝑥 → (((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) ↔ ((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1))))
1817cbvralv 3324 . . . . . . . 8 (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) ↔ ∀𝑥 ∈ (0..^𝑁)((2nd𝐴)‘(𝑥 + 1)) = ((2nd𝐵)‘(𝑥 + 1)))
1914, 18sylibr 225 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)))
20 fzossfz 12718 . . . . . . . . . 10 (0..^𝑁) ⊆ (0...𝑁)
21 ssralv 3822 . . . . . . . . . 10 ((0..^𝑁) ⊆ (0...𝑁) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)))
2220, 21mp1i 13 . . . . . . . . 9 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)))
23 r19.26 3216 . . . . . . . . . . 11 (∀𝑦 ∈ (0..^𝑁)(((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) ↔ (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))))
24 preq12 4417 . . . . . . . . . . . . 13 ((((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})
2524a1i 11 . . . . . . . . . . . 12 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → ((((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
2625ralimdv 3115 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁)(((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
2723, 26syl5bir 234 . . . . . . . . . 10 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → ((∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) ∧ ∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1))) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
2827expd 401 . . . . . . . . 9 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
2922, 28syld 47 . . . . . . . 8 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
3029imp 394 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → (∀𝑦 ∈ (0..^𝑁)((2nd𝐴)‘(𝑦 + 1)) = ((2nd𝐵)‘(𝑦 + 1)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
3119, 30mpd 15 . . . . . 6 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})
3231ex 398 . . . . 5 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
33 uspgrupgr 26314 . . . . . . . 8 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
34 eqid 2774 . . . . . . . . . 10 (Vtx‘𝐺) = (Vtx‘𝐺)
35 eqid 2774 . . . . . . . . . 10 (iEdg‘𝐺) = (iEdg‘𝐺)
36 eqid 2774 . . . . . . . . . 10 (1st𝐴) = (1st𝐴)
37 eqid 2774 . . . . . . . . . 10 (2nd𝐴) = (2nd𝐴)
3834, 35, 36, 37upgrwlkcompim 26795 . . . . . . . . 9 ((𝐺 ∈ UPGraph ∧ 𝐴 ∈ (Walks‘𝐺)) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(♯‘(1st𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}))
3938ex 398 . . . . . . . 8 (𝐺 ∈ UPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(♯‘(1st𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))})))
4033, 39syl 17 . . . . . . 7 (𝐺 ∈ USPGraph → (𝐴 ∈ (Walks‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(♯‘(1st𝐴)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))})))
41 eqid 2774 . . . . . . . . . 10 (1st𝐵) = (1st𝐵)
42 eqid 2774 . . . . . . . . . 10 (2nd𝐵) = (2nd𝐵)
4334, 35, 41, 42upgrwlkcompim 26795 . . . . . . . . 9 ((𝐺 ∈ UPGraph ∧ 𝐵 ∈ (Walks‘𝐺)) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(♯‘(1st𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
4443ex 398 . . . . . . . 8 (𝐺 ∈ UPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(♯‘(1st𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
4533, 44syl 17 . . . . . . 7 (𝐺 ∈ USPGraph → (𝐵 ∈ (Walks‘𝐺) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(♯‘(1st𝐵)))⟶(Vtx‘𝐺) ∧ ∀𝑦 ∈ (0..^(♯‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))})))
46 oveq2 6820 . . . . . . . . . . . . . . . . . . 19 ((♯‘(1st𝐵)) = 𝑁 → (0..^(♯‘(1st𝐵))) = (0..^𝑁))
4746eqcoms 2782 . . . . . . . . . . . . . . . . . 18 (𝑁 = (♯‘(1st𝐵)) → (0..^(♯‘(1st𝐵))) = (0..^𝑁))
4847raleqdv 3297 . . . . . . . . . . . . . . . . 17 (𝑁 = (♯‘(1st𝐵)) → (∀𝑦 ∈ (0..^(♯‘(1st𝐵)))((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
49 oveq2 6820 . . . . . . . . . . . . . . . . . . 19 ((♯‘(1st𝐴)) = 𝑁 → (0..^(♯‘(1st𝐴))) = (0..^𝑁))
5049eqcoms 2782 . . . . . . . . . . . . . . . . . 18 (𝑁 = (♯‘(1st𝐴)) → (0..^(♯‘(1st𝐴))) = (0..^𝑁))
5150raleqdv 3297 . . . . . . . . . . . . . . . . 17 (𝑁 = (♯‘(1st𝐴)) → (∀𝑦 ∈ (0..^(♯‘(1st𝐴)))((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} ↔ ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}))
5248, 51bi2anan9r 622 . . . . . . . . . . . . . . . 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 3216 . . . . . . . . . . . . . . . . 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 2785 . . . . . . . . . . . . . . . . . . . . 21 ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))}))
55 eqeq2 2785 . . . . . . . . . . . . . . . . . . . . . . 23 ({((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
5655eqcoms 2782 . . . . . . . . . . . . . . . . . . . . . 22 (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ↔ ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
5756biimpd 220 . . . . . . . . . . . . . . . . . . . . 21 (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
5854, 57syl6bi 244 . . . . . . . . . . . . . . . . . . . 20 ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)))))
5958com13 88 . . . . . . . . . . . . . . . . . . 19 (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} → ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)))))
6059imp 394 . . . . . . . . . . . . . . . . . 18 ((((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}) → ({((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
6160ral2imi 3099 . . . . . . . . . . . . . . . . 17 (∀𝑦 ∈ (0..^𝑁)(((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} ∧ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = {((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))}) → (∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
6253, 61sylbir 226 . . . . . . . . . . . . . . . 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𝐴)‘𝑦))))
6352, 62syl6bi 244 . . . . . . . . . . . . . . 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𝐴)‘𝑦)))))
6463com12 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𝐴)‘𝑦)))))
6564ex 398 . . . . . . . . . . . . 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𝐴)‘𝑦))))))
66653ad2ant3 1156 . . . . . . . . . . . 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𝐴)‘𝑦))))))
6766com12 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𝐴)‘𝑦))))))
68673ad2ant3 1156 . . . . . . . . . 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𝐴)‘𝑦))))))
6968imp 394 . . . . . . . . 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𝐴)‘𝑦)))))
7069expd 401 . . . . . . . 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𝐴)‘𝑦))))))
7170a1i 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𝐴)‘𝑦)))))))
7240, 45, 71syl2and 596 . . . . . 6 (𝐺 ∈ USPGraph → ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (♯‘(1st𝐴)) → (𝑁 = (♯‘(1st𝐵)) → (∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)))))))
73723imp1 1446 . . . . 5 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁){((2nd𝐴)‘𝑦), ((2nd𝐴)‘(𝑦 + 1))} = {((2nd𝐵)‘𝑦), ((2nd𝐵)‘(𝑦 + 1))} → ∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦))))
74 eqcom 2781 . . . . . . 7 (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) ↔ ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)))
7535uspgrf1oedg 26311 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺))
76 f1of1 6292 . . . . . . . . . . . 12 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
7775, 76syl 17 . . . . . . . . . . 11 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺))
78 eqidd 2775 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → (iEdg‘𝐺) = (iEdg‘𝐺))
79 eqidd 2775 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → dom (iEdg‘𝐺) = dom (iEdg‘𝐺))
80 edgval 26183 . . . . . . . . . . . . . 14 (Edg‘𝐺) = ran (iEdg‘𝐺)
8180eqcomi 2783 . . . . . . . . . . . . 13 ran (iEdg‘𝐺) = (Edg‘𝐺)
8281a1i 11 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → ran (iEdg‘𝐺) = (Edg‘𝐺))
8378, 79, 82f1eq123d 6287 . . . . . . . . . . 11 (𝐺 ∈ USPGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(Edg‘𝐺)))
8477, 83mpbird 248 . . . . . . . . . 10 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
85843ad2ant1 1154 . . . . . . . . 9 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
8685adantr 467 . . . . . . . 8 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺))
8734, 35, 36, 37wlkelwrd 26784 . . . . . . . . . . . . . . 15 (𝐴 ∈ (Walks‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐴):(0...(♯‘(1st𝐴)))⟶(Vtx‘𝐺)))
8834, 35, 41, 42wlkelwrd 26784 . . . . . . . . . . . . . . 15 (𝐵 ∈ (Walks‘𝐺) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(♯‘(1st𝐵)))⟶(Vtx‘𝐺)))
89 oveq2 6820 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑁 = (♯‘(1st𝐴)) → (0..^𝑁) = (0..^(♯‘(1st𝐴))))
9089eleq2d 2839 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑁 = (♯‘(1st𝐴)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(♯‘(1st𝐴)))))
91 wrdsymbcl 13536 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (((1st𝐴) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(♯‘(1st𝐴)))) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))
9291expcom 399 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑦 ∈ (0..^(♯‘(1st𝐴))) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
9390, 92syl6bi 244 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑁 = (♯‘(1st𝐴)) → (𝑦 ∈ (0..^𝑁) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
9493adantr 467 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺))))
9594imp 394 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
9695com12 32 . . . . . . . . . . . . . . . . . . . . . 22 ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
9796adantl 468 . . . . . . . . . . . . . . . . . . . . 21 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺)))
98 oveq2 6820 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑁 = (♯‘(1st𝐵)) → (0..^𝑁) = (0..^(♯‘(1st𝐵))))
9998eleq2d 2839 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑁 = (♯‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) ↔ 𝑦 ∈ (0..^(♯‘(1st𝐵)))))
100 wrdsymbcl 13536 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ 𝑦 ∈ (0..^(♯‘(1st𝐵)))) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))
101100expcom 399 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑦 ∈ (0..^(♯‘(1st𝐵))) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
10299, 101syl6bi 244 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑁 = (♯‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
103102adantl 468 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
104103imp 394 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
105104com12 32 . . . . . . . . . . . . . . . . . . . . . 22 ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
106105adantr 467 . . . . . . . . . . . . . . . . . . . . 21 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
10797, 106jcad 503 . . . . . . . . . . . . . . . . . . . 20 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (1st𝐴) ∈ Word dom (iEdg‘𝐺)) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
108107ex 398 . . . . . . . . . . . . . . . . . . 19 ((1st𝐵) ∈ Word dom (iEdg‘𝐺) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
109108adantr 467 . . . . . . . . . . . . . . . . . 18 (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(♯‘(1st𝐵)))⟶(Vtx‘𝐺)) → ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
110109com12 32 . . . . . . . . . . . . . . . . 17 ((1st𝐴) ∈ Word dom (iEdg‘𝐺) → (((1st𝐵) ∈ Word dom (iEdg‘𝐺) ∧ (2nd𝐵):(0...(♯‘(1st𝐵)))⟶(Vtx‘𝐺)) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
111110adantr 467 . . . . . . . . . . . . . . . 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‘𝐺)))))
112111imp 394 . . . . . . . . . . . . . . 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‘𝐺))))
11387, 88, 112syl2an 584 . . . . . . . . . . . . . 14 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
114113expd 401 . . . . . . . . . . . . 13 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → ((𝑁 = (♯‘(1st𝐴)) ∧ 𝑁 = (♯‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
115114expd 401 . . . . . . . . . . . 12 ((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) → (𝑁 = (♯‘(1st𝐴)) → (𝑁 = (♯‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))))
116115imp 394 . . . . . . . . . . 11 (((𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → (𝑁 = (♯‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
1171163adant1 1151 . . . . . . . . . 10 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → (𝑁 = (♯‘(1st𝐵)) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))))
118117imp 394 . . . . . . . . 9 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (𝑦 ∈ (0..^𝑁) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))))
119118imp 394 . . . . . . . 8 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺)))
120 f1veqaeq 6676 . . . . . . . 8 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→ran (iEdg‘𝐺) ∧ (((1st𝐴)‘𝑦) ∈ dom (iEdg‘𝐺) ∧ ((1st𝐵)‘𝑦) ∈ dom (iEdg‘𝐺))) → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) → ((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
12186, 119, 120syl2an2r 665 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) → ((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
12274, 121syl5bi 233 . . . . . 6 ((((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) ∧ 𝑦 ∈ (0..^𝑁)) → (((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) → ((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
123122ralimdva 3114 . . . . 5 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0..^𝑁)((iEdg‘𝐺)‘((1st𝐵)‘𝑦)) = ((iEdg‘𝐺)‘((1st𝐴)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
12432, 73, 1233syld 60 . . . 4 (((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) ∧ 𝑁 = (♯‘(1st𝐵))) → (∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦) → ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
125124expimpd 442 . . 3 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → ((𝑁 = (♯‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) → ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦)))
126125pm4.71d 552 . 2 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → ((𝑁 = (♯‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ↔ ((𝑁 = (♯‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦)) ∧ ∀𝑦 ∈ (0..^𝑁)((1st𝐴)‘𝑦) = ((1st𝐵)‘𝑦))))
1272, 5, 1263bitr4d 301 1 ((𝐺 ∈ USPGraph ∧ (𝐴 ∈ (Walks‘𝐺) ∧ 𝐵 ∈ (Walks‘𝐺)) ∧ 𝑁 = (♯‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (♯‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 383  w3a 1098   = wceq 1634  wcel 2148  wral 3064  wss 3729  {cpr 4328  dom cdm 5263  ran crn 5264  wf 6038  1-1wf1 6039  1-1-ontowf1o 6041  cfv 6042  (class class class)co 6812  1st c1st 7334  2nd c2nd 7335  0cc0 10159  1c1 10160   + caddc 10162  ...cfz 12555  ..^cfzo 12695  chash 13343  Word cword 13509  Vtxcvtx 26116  iEdgciedg 26117  Edgcedg 26181  UPGraphcupgr 26217  USPGraphcuspgr 26286  Walkscwlks 26748
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1873  ax-4 1888  ax-5 1994  ax-6 2060  ax-7 2096  ax-8 2150  ax-9 2157  ax-10 2177  ax-11 2193  ax-12 2206  ax-13 2411  ax-ext 2754  ax-rep 4917  ax-sep 4928  ax-nul 4936  ax-pow 4988  ax-pr 5048  ax-un 7117  ax-cnex 10215  ax-resscn 10216  ax-1cn 10217  ax-icn 10218  ax-addcl 10219  ax-addrcl 10220  ax-mulcl 10221  ax-mulrcl 10222  ax-mulcom 10223  ax-addass 10224  ax-mulass 10225  ax-distr 10226  ax-i2m1 10227  ax-1ne0 10228  ax-1rid 10229  ax-rnegex 10230  ax-rrecex 10231  ax-cnre 10232  ax-pre-lttri 10233  ax-pre-lttrn 10234  ax-pre-ltadd 10235  ax-pre-mulgt0 10236
This theorem depends on definitions:  df-bi 198  df-an 384  df-or 864  df-ifp 1077  df-3or 1099  df-3an 1100  df-tru 1637  df-ex 1856  df-nf 1861  df-sb 2053  df-eu 2625  df-mo 2626  df-clab 2761  df-cleq 2767  df-clel 2770  df-nfc 2905  df-ne 2947  df-nel 3050  df-ral 3069  df-rex 3070  df-reu 3071  df-rmo 3072  df-rab 3073  df-v 3357  df-sbc 3594  df-csb 3689  df-dif 3732  df-un 3734  df-in 3736  df-ss 3743  df-pss 3745  df-nul 4074  df-if 4236  df-pw 4309  df-sn 4327  df-pr 4329  df-tp 4331  df-op 4333  df-uni 4586  df-int 4623  df-iun 4667  df-br 4798  df-opab 4860  df-mpt 4877  df-tr 4900  df-id 5171  df-eprel 5176  df-po 5184  df-so 5185  df-fr 5222  df-we 5224  df-xp 5269  df-rel 5270  df-cnv 5271  df-co 5272  df-dm 5273  df-rn 5274  df-res 5275  df-ima 5276  df-pred 5834  df-ord 5880  df-on 5881  df-lim 5882  df-suc 5883  df-iota 6005  df-fun 6044  df-fn 6045  df-f 6046  df-f1 6047  df-fo 6048  df-f1o 6049  df-fv 6050  df-riota 6773  df-ov 6815  df-oprab 6816  df-mpt2 6817  df-om 7234  df-1st 7336  df-2nd 7337  df-wrecs 7580  df-recs 7642  df-rdg 7680  df-1o 7734  df-2o 7735  df-oadd 7738  df-er 7917  df-map 8032  df-pm 8033  df-en 8131  df-dom 8132  df-sdom 8133  df-fin 8134  df-card 8986  df-cda 9213  df-pnf 10299  df-mnf 10300  df-xr 10301  df-ltxr 10302  df-le 10303  df-sub 10491  df-neg 10492  df-nn 11244  df-2 11302  df-n0 11517  df-xnn0 11588  df-z 11602  df-uz 11911  df-fz 12556  df-fzo 12696  df-hash 13344  df-word 13517  df-edg 26182  df-uhgr 26195  df-upgr 26219  df-uspgr 26288  df-wlks 26751
This theorem is referenced by:  uspgr2wlkeq2  26799  clwlkclwwlkf1  27181  clwlksf1clwwlkOLD  27271
  Copyright terms: Public domain W3C validator