∀ {V : Type u_1} {G : SimpleGraph V} {u v : V} [inst : DecidableEq V] {c : G.Walk v v},
  1 ≤ (List.filter (fun x => decide (x = u)) c.support).length →
    0 < (List.findIdxs (fun x => decide (x = u)) c.support).length