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


DEBUG:Going to execute:
let ty := type of B in
           intro || (let H := fresh in
                     intro
                     H)
Level 2: Backtrace:

Could not infer a simplification step.
Level 2: Backtrace:

Could not infer a simplification step.
Level 2: Backtrace:

Could not infer a simplification step.
Level 2: Backtrace:

Could not infer a simplification step.