Theorem: Graph.EdgePath.concat_eq_append_edge (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 u : V
e : EdgeBetween G w u
p : EdgePath G v w
⊢ concat p e = p ++ cons e (nil u)
Tactic:
have := concat_append e p (.nil _)
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 u : V
e : EdgeBetween G w u
p : EdgePath G v w
this : concat p e ++ nil u = p ++ cons e (nil u)
⊢ concat p e = p ++ cons e (nil u)

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 u : V
e : EdgeBetween G w u
p : EdgePath G v w
this : concat p e ++ nil u = p ++ cons e (nil u)
⊢ concat p e = p ++ cons e (nil u)
Tactic:
aesop
State after:
no goals