Theorem: Digraph.Walk.concat_append (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 x : V
p : Walk G u v
h : G.Adj v w
q : Walk G w x
⊢ append (concat p h) q = append p (cons h q)
Tactic:
rw [concat_eq_append, ← append_assoc, cons_nil_append]
State after:
no goals