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

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
u v w : V
h : G.Adj u v
p : Walk G v w
⊢ IsPath (cons h p) → IsPath p
Tactic:
simp [isPath_def]
State after:
no goals