Theorem: Graph.EdgePath.reverse_append (Lectures/Graph.lean)

State before:
V : Type u
E : Type v
G : Graph V E
u✝ v✝ w✝ : V
e : EdgeBetween G v✝ w✝
u v w : V
p : EdgePath G u v
q : EdgePath G v w
⊢ reverse (p ++ q) = reverse q ++ reverse p
Tactic:
induction p <;>
  aesop (add norm simp [reverse_cons, concat_eq_append_edge, append_assoc])
State after:
no goals