Goal:
  
  T : Type -> Type
  M : Monad T
  A : Type
  P : nat -> A -> Type
  k : nat
  a : A
  l : list A
  ============================
   ((forall (n : nat) (x : A),
     nth_error (a :: l) n = Some x -> T (∥ P (k + n) x ∥)) ->
    ∥ 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:
intro || (let H := fresh in
                     intro
                     H)
DEBUG LTAC Evaluated term: (∥ 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 LTAC Evaluated term: Prop