Theorem: Graph.PathClass.inv_eq_inv (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
p : u ⟶ v
⊢ PathClass.inv p = inv p
Tactic:
rw [← Groupoid.inv_eq_inv]
State after:
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
p : u ⟶ v
⊢ PathClass.inv p = Groupoid.inv p

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
p : u ⟶ v
⊢ PathClass.inv p = Groupoid.inv p
Tactic:
rfl
State after:
no goals