Theorem: Graph.self_append_reverse (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 w v
⊢ [[p ++ reverse p]] = [[nil w]]
Tactic:
have := reverse_append_self p.reverse
State after:
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 w v
this : [[reverse (reverse p) ++ reverse p]] = [[nil w]]
⊢ [[p ++ reverse p]] = [[nil w]]

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 w v
this : [[reverse (reverse p) ++ reverse p]] = [[nil w]]
⊢ [[p ++ reverse p]] = [[nil w]]
Tactic:
aesop
State after:
no goals