Theorem: Digraph.Walk.IsTrail.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
⊢ List.Nodup (edges Walk.nil)
Tactic:
simp [edges]
State after:
no goals