Theorem: Digraph.Walk.map_isCycle_iff_of_injective (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
p : Walk G u u
hinj : Injective ↑f
⊢ IsCycle (Walk.map f p) ↔ IsCycle p
Tactic:
rw [isCycle_def, isCycle_def, map_isTrail_iff_of_injective hinj, Ne.def, map_eq_nil_iff,
  support_map, ← List.map_tail, List.nodup_map_iff hinj]
State after:
no goals