(* There is nth_error in the Coq library, but it seems to return something in Type. *)
Fixpoint nth_option(A : Set)(ls : list A)(i : nat) :=
  match ls with 
    | nil => None
    | a :: ls' =>
      match i with
        | O => Some a
        | S i' =>
          nth_option ls' i'
          end
  end.

Theorem fold_add_const_mult : forall (A : Type)(ls : list A)(c : nat) init, (fold_left (fun acc _ => acc + c) ls init = (length ls) * c + init)%nat.