Theorem: Digraph.Walk.fst_mem_support_of_mem_edges (GraphProjects/DigraphConnectivity.lean)

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
t u v w : V
p : Walk G v w
he : (t, u) ∈ edges p
⊢ t ∈ support p
Tactic:
exact edges_fst_mem_support_of_mem_darts _ he
State after:
no goals