have hyp' :=  reverse_reduced p hyp
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
v w u : V
p : EdgePath G v w
e : EdgeBetween G w u
hyp : reduced p
⊢ p:+e:+EdgeBetween.bar e = p
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
v w u : V
p : EdgePath G v w
e : EdgeBetween G w u
hyp : reduced p
hyp' : reduced (reverse p)
⊢ p:+e:+EdgeBetween.bar e = p