Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rusgrnumwwlks Structured version   Visualization version   GIF version

Theorem rusgrnumwwlks 41177
 Description: Induction step for rusgrnumwwlk 41178. (Contributed by Alexander van der Vekens, 24-Aug-2018.) (Revised by AV, 7-May-2021.)
Hypotheses
Ref Expression
rusgrnumwwlk.v 𝑉 = (Vtx‘𝐺)
rusgrnumwwlk.l 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (#‘{𝑤 ∈ (𝑛 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑣}))
Assertion
Ref Expression
rusgrnumwwlks ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → ((𝑃𝐿𝑁) = (𝐾𝑁) → (𝑃𝐿(𝑁 + 1)) = (𝐾↑(𝑁 + 1))))
Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑛,𝑁,𝑣,𝑤   𝑃,𝑛,𝑣,𝑤   𝑛,𝑉,𝑣,𝑤   𝑤,𝐾
Allowed substitution hints:   𝐾(𝑣,𝑛)   𝐿(𝑤,𝑣,𝑛)

Proof of Theorem rusgrnumwwlks
Dummy variables 𝑖 𝑝 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr2 1061 . . 3 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝑃𝑉)
2 simpr3 1062 . . 3 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝑁 ∈ ℕ0)
3 rusgrnumwwlk.v . . . . 5 𝑉 = (Vtx‘𝐺)
4 rusgrnumwwlk.l . . . . 5 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (#‘{𝑤 ∈ (𝑛 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑣}))
53, 4rusgrnumwwlklem 41173 . . . 4 ((𝑃𝑉𝑁 ∈ ℕ0) → (𝑃𝐿𝑁) = (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}))
65eqeq1d 2612 . . 3 ((𝑃𝑉𝑁 ∈ ℕ0) → ((𝑃𝐿𝑁) = (𝐾𝑁) ↔ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)))
71, 2, 6syl2anc 691 . 2 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → ((𝑃𝐿𝑁) = (𝐾𝑁) ↔ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)))
8 eqid 2610 . . . . . . . . . . . . 13 (Edg‘𝐺) = (Edg‘𝐺)
98wwlksnredwwlkn0 41102 . . . . . . . . . . . 12 ((𝑁 ∈ ℕ0𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺)) → ((𝑤‘0) = 𝑃 ↔ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))))
109ex 449 . . . . . . . . . . 11 (𝑁 ∈ ℕ0 → (𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) → ((𝑤‘0) = 𝑃 ↔ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)))))
11103ad2ant3 1077 . . . . . . . . . 10 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) → ((𝑤‘0) = 𝑃 ↔ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)))))
1211adantl 481 . . . . . . . . 9 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) → ((𝑤‘0) = 𝑃 ↔ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)))))
1312imp 444 . . . . . . . 8 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ 𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺)) → ((𝑤‘0) = 𝑃 ↔ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))))
1413rabbidva 3163 . . . . . . 7 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} = {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))})
1514adantr 480 . . . . . 6 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} = {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))})
1615fveq2d 6107 . . . . 5 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
17 simp2 1055 . . . . . . . . . . . . 13 (((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)) → (𝑦‘0) = 𝑃)
1817pm4.71ri 663 . . . . . . . . . . . 12 (((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)) ↔ ((𝑦‘0) = 𝑃 ∧ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))))
1918a1i 11 . . . . . . . . . . 11 ((((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ 𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺)) ∧ 𝑦 ∈ (𝑁 WWalkSN 𝐺)) → (((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)) ↔ ((𝑦‘0) = 𝑃 ∧ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)))))
2019rexbidva 3031 . . . . . . . . . 10 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ 𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺)) → (∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)) ↔ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑦‘0) = 𝑃 ∧ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)))))
21 fveq1 6102 . . . . . . . . . . . 12 (𝑥 = 𝑦 → (𝑥‘0) = (𝑦‘0))
2221eqeq1d 2612 . . . . . . . . . . 11 (𝑥 = 𝑦 → ((𝑥‘0) = 𝑃 ↔ (𝑦‘0) = 𝑃))
2322rexrab 3337 . . . . . . . . . 10 (∃𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)) ↔ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑦‘0) = 𝑃 ∧ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))))
2420, 23syl6bbr 277 . . . . . . . . 9 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ 𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺)) → (∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺)) ↔ ∃𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))))
2524rabbidva 3163 . . . . . . . 8 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))} = {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))})
2625adantr 480 . . . . . . 7 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))} = {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))})
2726fveq2d 6107 . . . . . 6 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
28 simplr1 1096 . . . . . . 7 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → 𝑉 ∈ Fin)
293eleq1i 2679 . . . . . . . 8 (𝑉 ∈ Fin ↔ (Vtx‘𝐺) ∈ Fin)
3029biimpi 205 . . . . . . 7 (𝑉 ∈ Fin → (Vtx‘𝐺) ∈ Fin)
31 eqid 2610 . . . . . . . 8 ((𝑁 + 1) WWalkSN 𝐺) = ((𝑁 + 1) WWalkSN 𝐺)
32 eqid 2610 . . . . . . . 8 {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} = {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃}
3331, 8, 32hashwwlksnext 41120 . . . . . . 7 ((Vtx‘𝐺) ∈ Fin → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = Σ𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
3428, 30, 333syl 18 . . . . . 6 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = Σ𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
35 fveq1 6102 . . . . . . . . . 10 (𝑥 = 𝑤 → (𝑥‘0) = (𝑤‘0))
3635eqeq1d 2612 . . . . . . . . 9 (𝑥 = 𝑤 → ((𝑥‘0) = 𝑃 ↔ (𝑤‘0) = 𝑃))
3736cbvrabv 3172 . . . . . . . 8 {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}
3837sumeq1i 14276 . . . . . . 7 Σ𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))})
3938a1i 11 . . . . . 6 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → Σ𝑦 ∈ {𝑥 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑥‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
4027, 34, 393eqtrd 2648 . . . . 5 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ∃𝑦 ∈ (𝑁 WWalkSN 𝐺)((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
41 rusgranumwlklem0 26475 . . . . . . . . . . 11 (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))} = {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))})
4241eqcomd 2616 . . . . . . . . . 10 (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))} = {𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))})
4342fveq2d 6107 . . . . . . . . 9 (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
4443adantl 481 . . . . . . . 8 ((((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) ∧ 𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}))
45 elrabi 3328 . . . . . . . . . 10 (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → 𝑦 ∈ (𝑁 WWalkSN 𝐺))
4645adantl 481 . . . . . . . . 9 ((((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) ∧ 𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) → 𝑦 ∈ (𝑁 WWalkSN 𝐺))
473, 8wwlksnexthasheq 41109 . . . . . . . . 9 (𝑦 ∈ (𝑁 WWalkSN 𝐺) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}))
4846, 47syl 17 . . . . . . . 8 ((((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) ∧ 𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}))
493rusgrpropadjvtx 40785 . . . . . . . . . 10 (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑝𝑉 (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾))
50 fveq1 6102 . . . . . . . . . . . . . . . . . . . 20 (𝑤 = 𝑦 → (𝑤‘0) = (𝑦‘0))
5150eqeq1d 2612 . . . . . . . . . . . . . . . . . . 19 (𝑤 = 𝑦 → ((𝑤‘0) = 𝑃 ↔ (𝑦‘0) = 𝑃))
5251elrab 3331 . . . . . . . . . . . . . . . . . 18 (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ↔ (𝑦 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑦‘0) = 𝑃))
533, 8wwlknp 41045 . . . . . . . . . . . . . . . . . . . 20 (𝑦 ∈ (𝑁 WWalkSN 𝐺) → (𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑦𝑖), (𝑦‘(𝑖 + 1))} ∈ (Edg‘𝐺)))
5453adantr 480 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑦‘0) = 𝑃) → (𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑦𝑖), (𝑦‘(𝑖 + 1))} ∈ (Edg‘𝐺)))
55 simpll 786 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝑦 ∈ Word 𝑉)
56 nn0p1gt0 11199 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑁 ∈ ℕ0 → 0 < (𝑁 + 1))
57563ad2ant3 1077 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 0 < (𝑁 + 1))
5857adantl 481 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 0 < (𝑁 + 1))
59 breq2 4587 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((#‘𝑦) = (𝑁 + 1) → (0 < (#‘𝑦) ↔ 0 < (𝑁 + 1)))
6059ad2antlr 759 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (0 < (#‘𝑦) ↔ 0 < (𝑁 + 1)))
6158, 60mpbird 246 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 0 < (#‘𝑦))
62 hashle00 13049 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑦 ∈ Word 𝑉 → ((#‘𝑦) ≤ 0 ↔ 𝑦 = ∅))
63 lencl 13179 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (𝑦 ∈ Word 𝑉 → (#‘𝑦) ∈ ℕ0)
6463nn0red 11229 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑦 ∈ Word 𝑉 → (#‘𝑦) ∈ ℝ)
65 0re 9919 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 0 ∈ ℝ
66 lenlt 9995 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (((#‘𝑦) ∈ ℝ ∧ 0 ∈ ℝ) → ((#‘𝑦) ≤ 0 ↔ ¬ 0 < (#‘𝑦)))
6766bicomd 212 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (((#‘𝑦) ∈ ℝ ∧ 0 ∈ ℝ) → (¬ 0 < (#‘𝑦) ↔ (#‘𝑦) ≤ 0))
6864, 65, 67sylancl 693 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑦 ∈ Word 𝑉 → (¬ 0 < (#‘𝑦) ↔ (#‘𝑦) ≤ 0))
69 nne 2786 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 𝑦 ≠ ∅ ↔ 𝑦 = ∅)
7069a1i 11 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑦 ∈ Word 𝑉 → (¬ 𝑦 ≠ ∅ ↔ 𝑦 = ∅))
7162, 68, 703bitr4rd 300 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑦 ∈ Word 𝑉 → (¬ 𝑦 ≠ ∅ ↔ ¬ 0 < (#‘𝑦)))
7271ad2antrr 758 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (¬ 𝑦 ≠ ∅ ↔ ¬ 0 < (#‘𝑦)))
7372con4bid 306 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝑦 ≠ ∅ ↔ 0 < (#‘𝑦)))
7461, 73mpbird 246 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝑦 ≠ ∅)
7555, 74jca 553 . . . . . . . . . . . . . . . . . . . . 21 (((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝑦 ∈ Word 𝑉𝑦 ≠ ∅))
7675ex 449 . . . . . . . . . . . . . . . . . . . 20 ((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1)) → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝑦 ∈ Word 𝑉𝑦 ≠ ∅)))
77763adant3 1074 . . . . . . . . . . . . . . . . . . 19 ((𝑦 ∈ Word 𝑉 ∧ (#‘𝑦) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑦𝑖), (𝑦‘(𝑖 + 1))} ∈ (Edg‘𝐺)) → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝑦 ∈ Word 𝑉𝑦 ≠ ∅)))
7854, 77syl 17 . . . . . . . . . . . . . . . . . 18 ((𝑦 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑦‘0) = 𝑃) → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝑦 ∈ Word 𝑉𝑦 ≠ ∅)))
7952, 78sylbi 206 . . . . . . . . . . . . . . . . 17 (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝑦 ∈ Word 𝑉𝑦 ≠ ∅)))
8079imp 444 . . . . . . . . . . . . . . . 16 ((𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝑦 ∈ Word 𝑉𝑦 ≠ ∅))
81 lswcl 13208 . . . . . . . . . . . . . . . 16 ((𝑦 ∈ Word 𝑉𝑦 ≠ ∅) → ( lastS ‘𝑦) ∈ 𝑉)
8280, 81syl 17 . . . . . . . . . . . . . . 15 ((𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → ( lastS ‘𝑦) ∈ 𝑉)
8382ad2antrr 758 . . . . . . . . . . . . . 14 ((((𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) ∧ ∀𝑝𝑉 (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾) → ( lastS ‘𝑦) ∈ 𝑉)
84 preq1 4212 . . . . . . . . . . . . . . . . . . 19 (𝑝 = ( lastS ‘𝑦) → {𝑝, 𝑛} = {( lastS ‘𝑦), 𝑛})
8584eleq1d 2672 . . . . . . . . . . . . . . . . . 18 (𝑝 = ( lastS ‘𝑦) → ({𝑝, 𝑛} ∈ (Edg‘𝐺) ↔ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)))
8685rabbidv 3164 . . . . . . . . . . . . . . . . 17 (𝑝 = ( lastS ‘𝑦) → {𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)} = {𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)})
8786fveq2d 6107 . . . . . . . . . . . . . . . 16 (𝑝 = ( lastS ‘𝑦) → (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}))
8887eqeq1d 2612 . . . . . . . . . . . . . . 15 (𝑝 = ( lastS ‘𝑦) → ((#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾 ↔ (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾))
8988rspcva 3280 . . . . . . . . . . . . . 14 ((( lastS ‘𝑦) ∈ 𝑉 ∧ ∀𝑝𝑉 (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾) → (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾)
9083, 89sylancom 698 . . . . . . . . . . . . 13 ((((𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) ∧ ∀𝑝𝑉 (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾) → (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾)
9190exp41 636 . . . . . . . . . . . 12 (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁) → (∀𝑝𝑉 (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾 → (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾))))
9291com14 94 . . . . . . . . . . 11 (∀𝑝𝑉 (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾 → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁) → (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾))))
93923ad2ant3 1077 . . . . . . . . . 10 ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ0* ∧ ∀𝑝𝑉 (#‘{𝑛𝑉 ∣ {𝑝, 𝑛} ∈ (Edg‘𝐺)}) = 𝐾) → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁) → (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾))))
9449, 93syl 17 . . . . . . . . 9 (𝐺 RegUSGraph 𝐾 → ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁) → (𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} → (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾))))
9594imp41 617 . . . . . . . 8 ((((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) ∧ 𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) → (#‘{𝑛𝑉 ∣ {( lastS ‘𝑦), 𝑛} ∈ (Edg‘𝐺)}) = 𝐾)
9644, 48, 953eqtrd 2648 . . . . . . 7 ((((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) ∧ 𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = 𝐾)
9796sumeq2dv 14281 . . . . . 6 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}𝐾)
98 oveq1 6556 . . . . . . . 8 ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁) → ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) · 𝐾) = ((𝐾𝑁) · 𝐾))
9998adantl 481 . . . . . . 7 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) · 𝐾) = ((𝐾𝑁) · 𝐾))
100 wwlksnfi 41112 . . . . . . . . . . . 12 ((Vtx‘𝐺) ∈ Fin → (𝑁 WWalkSN 𝐺) ∈ Fin)
10129, 100sylbi 206 . . . . . . . . . . 11 (𝑉 ∈ Fin → (𝑁 WWalkSN 𝐺) ∈ Fin)
1021013ad2ant1 1075 . . . . . . . . . 10 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝑁 WWalkSN 𝐺) ∈ Fin)
103102ad2antlr 759 . . . . . . . . 9 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (𝑁 WWalkSN 𝐺) ∈ Fin)
104 rabfi 8070 . . . . . . . . 9 ((𝑁 WWalkSN 𝐺) ∈ Fin → {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ∈ Fin)
105103, 104syl 17 . . . . . . . 8 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ∈ Fin)
106 rusgrusgr 40764 . . . . . . . . . . . . 13 (𝐺 RegUSGraph 𝐾𝐺 ∈ USGraph )
107 simp1 1054 . . . . . . . . . . . . 13 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝑉 ∈ Fin)
108106, 107anim12i 588 . . . . . . . . . . . 12 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin))
1093isfusgr 40537 . . . . . . . . . . . 12 (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin))
110108, 109sylibr 223 . . . . . . . . . . 11 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝐺 ∈ FinUSGraph )
111 simpl 472 . . . . . . . . . . 11 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝐺 RegUSGraph 𝐾)
112 ne0i 3880 . . . . . . . . . . . . 13 (𝑃𝑉𝑉 ≠ ∅)
1131123ad2ant2 1076 . . . . . . . . . . . 12 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝑉 ≠ ∅)
114113adantl 481 . . . . . . . . . . 11 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝑉 ≠ ∅)
1153frusgrnn0 40771 . . . . . . . . . . 11 ((𝐺 ∈ FinUSGraph ∧ 𝐺 RegUSGraph 𝐾𝑉 ≠ ∅) → 𝐾 ∈ ℕ0)
116110, 111, 114, 115syl3anc 1318 . . . . . . . . . 10 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝐾 ∈ ℕ0)
117116nn0cnd 11230 . . . . . . . . 9 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → 𝐾 ∈ ℂ)
118117adantr 480 . . . . . . . 8 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → 𝐾 ∈ ℂ)
119 fsumconst 14364 . . . . . . . 8 (({𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} ∈ Fin ∧ 𝐾 ∈ ℂ) → Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}𝐾 = ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) · 𝐾))
120105, 118, 119syl2anc 691 . . . . . . 7 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}𝐾 = ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) · 𝐾))
121117, 2expp1d 12871 . . . . . . . 8 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝐾↑(𝑁 + 1)) = ((𝐾𝑁) · 𝐾))
122121adantr 480 . . . . . . 7 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (𝐾↑(𝑁 + 1)) = ((𝐾𝑁) · 𝐾))
12399, 120, 1223eqtr4d 2654 . . . . . 6 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}𝐾 = (𝐾↑(𝑁 + 1)))
12497, 123eqtrd 2644 . . . . 5 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → Σ𝑦 ∈ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑤)} ∈ (Edg‘𝐺))}) = (𝐾↑(𝑁 + 1)))
12516, 40, 1243eqtrd 2648 . . . 4 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾↑(𝑁 + 1)))
126 peano2nn0 11210 . . . . . . . 8 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
1271263ad2ant3 1077 . . . . . . 7 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝑁 + 1) ∈ ℕ0)
128127adantl 481 . . . . . 6 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝑁 + 1) ∈ ℕ0)
1293, 4rusgrnumwwlklem 41173 . . . . . . 7 ((𝑃𝑉 ∧ (𝑁 + 1) ∈ ℕ0) → (𝑃𝐿(𝑁 + 1)) = (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}))
130129eqeq1d 2612 . . . . . 6 ((𝑃𝑉 ∧ (𝑁 + 1) ∈ ℕ0) → ((𝑃𝐿(𝑁 + 1)) = (𝐾↑(𝑁 + 1)) ↔ (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾↑(𝑁 + 1))))
1311, 128, 130syl2anc 691 . . . . 5 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → ((𝑃𝐿(𝑁 + 1)) = (𝐾↑(𝑁 + 1)) ↔ (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾↑(𝑁 + 1))))
132131adantr 480 . . . 4 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → ((𝑃𝐿(𝑁 + 1)) = (𝐾↑(𝑁 + 1)) ↔ (#‘{𝑤 ∈ ((𝑁 + 1) WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾↑(𝑁 + 1))))
133125, 132mpbird 246 . . 3 (((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) ∧ (#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁)) → (𝑃𝐿(𝑁 + 1)) = (𝐾↑(𝑁 + 1)))
134133ex 449 . 2 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → ((#‘{𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (𝐾𝑁) → (𝑃𝐿(𝑁 + 1)) = (𝐾↑(𝑁 + 1))))
1357, 134sylbid 229 1 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → ((𝑃𝐿𝑁) = (𝐾𝑁) → (𝑃𝐿(𝑁 + 1)) = (𝐾↑(𝑁 + 1))))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  ∃wrex 2897  {crab 2900  ∅c0 3874  {cpr 4127  ⟨cop 4131   class class class wbr 4583  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  Fincfn 7841  ℂcc 9813  ℝcr 9814  0cc0 9815  1c1 9816   + caddc 9818   · cmul 9820   < clt 9953   ≤ cle 9954  ℕ0cn0 11169  ℕ0*cxnn0 11240  ..^cfzo 12334  ↑cexp 12722  #chash 12979  Word cword 13146   lastS clsw 13147   substr csubstr 13150  Σcsu 14264  Vtxcvtx 25673  Edgcedga 25792   USGraph cusgr 40379   FinUSGraph cfusgr 40535   RegUSGraph crusgr 40756   WWalkSN cwwlksn 41029 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-disj 4554  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-oi 8298  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-rp 11709  df-xadd 11823  df-fz 12198  df-fzo 12335  df-seq 12664  df-exp 12723  df-hash 12980  df-word 13154  df-lsw 13155  df-concat 13156  df-s1 13157  df-substr 13158  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-sum 14265  df-vtx 25675  df-iedg 25676  df-uhgr 25724  df-ushgr 25725  df-upgr 25749  df-umgr 25750  df-edga 25793  df-uspgr 40380  df-usgr 40381  df-fusgr 40536  df-nbgr 40554  df-vtxdg 40682  df-rgr 40757  df-rusgr 40758  df-wwlks 41033  df-wwlksn 41034 This theorem is referenced by:  rusgrnumwwlk  41178
 Copyright terms: Public domain W3C validator