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 ∥
  Y : ∥ Alli P (S k) l ∥
  ============================
   (∥ Alli P k (a :: l) ∥)


DEBUG:Going to execute:
match H with
           | H' => fail 2
           | _ => unify X Y; clear H' || clear H
           end
Level 4: Backtrace:

In environment
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 ∥
Y : ∥ Alli P (S k) l ∥
Unable to unify
 "forall (n : nat) (x : A),
  nth_error (a :: l) n = Some x -> T (∥ P (k + n) x ∥)"
with "∥ P (k + 0) a ∥".
Level 4: Backtrace:

In environment
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 ∥
Y : ∥ Alli P (S k) l ∥
Unable to unify
 "forall (n : nat) (x : A),
  nth_error (a :: l) n = Some x -> T (∥ P (k + n) x ∥)"
with "∥ P (k + 0) a ∥".
Level 4: Backtrace:

In environment
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 ∥
Y : ∥ Alli P (S k) l ∥
Unable to unify
 "forall (n : nat) (x : A),
  nth_error (a :: l) n = Some x -> T (∥ P (k + n) x ∥)"
with "∥ P (k + 0) a ∥".
Level 4: Backtrace:

In environment
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 ∥
Y : ∥ Alli P (S k) l ∥
Unable to unify
 "forall (n : nat) (x : A),
  nth_error (a :: l) n = Some x -> T (∥ P (k + n) x ∥)"
with "∥ P (k + 0) a ∥".
Level 3: Backtrace:

In environment
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 ∥
Y : ∥ Alli P (S k) l ∥
Unable to unify
 "forall (n : nat) (x : A),
  nth_error (a :: l) n = Some x -> T (∥ P (k + n) x ∥)"
with "∥ P (k + 0) a ∥".