Theorem: Digraph.Walk.edges_concat (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 w : V
p : Walk G u v
h : G.Adj v w
⊢ edges (concat p h) = List.concat (edges p) (v, w)
Tactic:
induction p <;> simp [*, concat_nil]
State after:
no goals