simp [cons_toList, reverse_cons, concat_toList]
case cons
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✝¹
G : Graph V E
v w v✝ w✝ u✝ : V
e : EdgeBetween G v✝ w✝
p' : EdgePath G w✝ u✝
ih : toList (reverse p') = List.map G.bar (List.reverse (toList p'))
⊢ toList (reverse (cons e p')) = List.map G.bar (List.reverse (toList (cons e p')))
case cons
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✝¹
G : Graph V E
v w v✝ w✝ u✝ : V
e : EdgeBetween G v✝ w✝
p' : EdgePath G w✝ u✝
ih : toList (reverse p') = List.map G.bar (List.reverse (toList p'))
⊢ toList (reverse p') = List.map G.bar (List.reverse (toList p'))