Theorem: Graph.PathClass.map_on_quotient (GroupComp/Graph/Covering.lean)

State before:
V₁ : Type u_1
E₁ : Type u_2
V₂ : Type u_4
E₂ : Type u_3
V : Type u
E : Type v
G₁ : Graph V₁ E₁
G₂ : Graph V₂ E₂
f : Morphism G₁ G₂
v w : V₁
η : EdgePath G₁ v w
⊢ map f [[η]] = [[EdgePath.map η f]]
Tactic:
rfl
State after:
no goals