∀ {V : Type u} {G : SimpleGraph V} {v w : V} (s : Set (Sym2 V)) {p : G.Walk v w} (hp : ∀ e ∈ p.edges, e ∉ s),
  SimpleGraph.Walk.map (SimpleGraph.Hom.ofLE ⋯) (SimpleGraph.Walk.toDeleteEdges s p hp) = p