Theorem: Graph.EdgePath.reverse_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
v : V
⊢ reverse (nil v) = nil v
Tactic:
rfl
State after:
no goals