Theorem: Graph.reverse_append_self (GroupComp/Graph.lean)

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