Theorem: Digraph.Walk.isPath_iff_eq_nil (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
p : Walk G u u
⊢ IsPath p ↔ p = nil
Tactic:
cases p <;> simp [IsPath.nil]
State after:
no goals