Theorem: Graph.PathClass.inv_equiv_reverse (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₁ : Type u_1
E✝ : Type u_2
G₁ : Graph V₁ E✝
v w : V₁
η : EdgePath G₁ v w
⊢ PathClass.inv [[η]] = [[reverse η]]
Tactic:
rfl
State after:
no goals