∀ {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,
        p₁.darts.length + k ≤ p₂.darts.length ∧
          ∀ (i : ℕ) (h : i < p₁.darts.length), p₂.darts[i + k]? = some p₁.darts[i]) →
      ∀ (k : ℕ) (hk : p₁.darts.length + k ≤ p₂.darts.length) (i : ℕ) (hi : i < p₁.support.length),
        i = p₁.length →
          (∀ (h : i - 1 < p₁.darts.length), p₂.darts[i - 1 + k]? = some p₁.darts[i - 1]) →
            p₂.support[i + k] = p₁.support[i]