Theorem: Digraph.Walk.IsTrail.count_edges_eq_one (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 : V
p : Walk G u v
h : IsTrail p
e : V × V
he : e ∈ edges p
⊢ List.count e (edges p) = 1
Tactic:
simpa using List.count_eq_one_of_mem h.edges_nodup he
State after:
no goals