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