Theorem: Graph.right_append_step (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
a₁ a₂ : EdgePath G v w
b : EdgePath G w u
rel : Reduction a₁ a₂
⊢ [[a₁ ++ b]] = [[a₂ ++ b]]
Tactic:
aesop (add norm simp [append_assoc])
State after:
no goals