Goal:
    T : Type -> Type  M : Monad T  A : Type  P : nat -> A -> Type
  ============================
   (forall (l0 : list A) (k : nat),
    (forall (n : nat) (x : A), nth_error l0 n = Some x -> T (∥ P (k + n) x ∥)) ->
    forall (a : A) (l : list A),
    a :: l = l0 ->
    ∥ P (k + 0) a ∥ ->
    forall (n : nat) (x : A),
    nth_error l n = Some x -> ∥ P (k + S n) x ∥ -> ∥ P (S (k + n)) x ∥)


DEBUG:Going to execute:
Tactics.program_simplify