Theorem: Graph.EdgeBetween.map_toList (GroupComp/Graph/Covering.lean)

State before:
V : Type u
E : Type v
V₁ : Type u_1
E₁ : Type u_2
V₂ : Type u_3
E₂ : Type u_4
G₁ : Graph V₁ E₁
G₂ : Graph V₂ E₂
f : Morphism G₁ G₂
v₁ w₁ : V₁
e : EdgeBetween G₁ v₁ w₁
⊢ (map f e).edge = f.toFuncE e.edge
Tactic:
simp [EdgeBetween.map, toList]
State after:
no goals