Theorem: Digraph.Path.not_mem_edges_of_loop (GraphProjects/DigraphConnectivity.lean)

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
v : V
e : V × V
p : Path G v v
⊢ ¬e ∈ Walk.edges ↑p
Tactic:
simp [p.loop_eq]
State after:
no goals