Theorem: Digraph.Path.mk'_mem_edges_singleton (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 : V
h : G.Adj u v
hne : u ≠ v
⊢ (u, v) ∈ Walk.edges ↑(singleton h hne)
Tactic:
simp [singleton]
State after:
no goals