Theorem: Digraph.Walk.edges_map (GraphProjects/DigraphConnectivity.lean)

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
f : G →g G'
f' : G' →g G''
u v u' v' : V
p : Walk G u v
⊢ edges (Walk.map f p) = List.map (Prod.map ↑f ↑f) (edges p)
Tactic:
induction p <;> simp [*]
State after:
no goals