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
  hnth : nth_error l n = Some x
  px : ∥ P (k + S n) x ∥
  ============================
   (∥ P (S (k + n)) x ∥)


DEBUG:Going to execute:
try (solve
            [ red; intros; Tactics.destruct_conjs; Tactics.autoinjections;
               Tactics.discriminates ])
Level 2: Backtrace:

No primitive equality found.
Level 2: Backtrace:

No primitive equality found.
Level 1: Backtrace:

No primitive equality found.
Level 0: Backtrace:

No primitive equality found.