∀ {V : Type u_1} {G : SimpleGraph V} {u v u' v' : V} {p₁ : G.Walk u v} {p₂ : G.Walk u' v'},
  ¬p₁.Nil →
    ∀ (k i : ℕ),
      i = p₁.length →
        (∀ (h : i - 1 < p₁.darts.length), p₂.darts[i - 1 + k]? = some p₁.darts[i - 1]) →
          ∀ (w : ℕ),
            (∀ (i : ℕ) (h : i + 1 ≤ p₁.darts.length), p₂.darts[w + i]? = some p₁.darts[i]) →
              w + (i - 1) < p₂.support.tail.length