Theorem: Digraph.Walk.IsPath.dropUntil (GraphProjects/DigraphConnectivity.lean)

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
inst✝ : DecidableEq V
u v w : V
p : Walk G v w
hc : IsPath p
h : u ∈ support p
⊢ IsPath (append (?m.222578 hc h) (dropUntil p u h))
Tactic:
rwa [← take_spec _ h] at hc
State after:
no goals