Theorem: Graph.EdgePath.append_nil (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
u v : V
p : EdgePath G u v
⊢ p ++ nil v = p
Tactic:
show append _ _ = _
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
u v : V
p : EdgePath G u v
⊢ append p (nil v) = p

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
u v : V
p : EdgePath G u v
⊢ append p (nil v) = p
Tactic:
induction p <;> aesop (add norm simp [append])
State after:
no goals