Definition singleton {A} k (x : A) : list (option A) := repeat None k ++ Some x :: nil.Definition gname := nat.Definition list_set {A} (m : list (option A)) k v : list (option A) :=
  firstn k m ++ repeat None (k - length m) ++ Some v :: skipn (S k) m.

Lemma map_repeat : forall {A B} (f : A -> B) x n, map f (repeat x n) = repeat (f x) n.