Theorem: Digraph.Walk.tail_support_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 : V
p : Walk G u v
p' : Walk G v w
⊢ List.tail (support (append p p')) = List.tail (support p) ++ List.tail (support p')
Tactic:
rw [support_append, List.tail_append_of_ne_nil _ _ (support_ne_nil _)]
State after:
no goals