Goal:
  
  T : Type -> Type
  M : Monad T
  A : Type
  P : nat -> A -> Type
  Q : A -> Type
  f : forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)
  n : nat
  a : A
  l : list A
  allq : ∥ All Q (a :: l) ∥
  X : ∥ P n a ∥
  Y : ∥ Alli P (S n) l ∥
  ============================
   (∥ Alli P n (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
Q : A -> Type
f : forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)
n : nat
a : A
l : list A
allq : ∥ All Q (a :: l) ∥
X : ∥ P n a ∥
Y : ∥ Alli P (S n) l ∥
Unable to unify "Type" with
 "forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)".
Level 4: Backtrace:

In environment
T : Type -> Type
M : Monad T
A : Type
P : nat -> A -> Type
Q : A -> Type
f : forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)
n : nat
a : A
l : list A
allq : ∥ All Q (a :: l) ∥
X : ∥ P n a ∥
Y : ∥ Alli P (S n) l ∥
Unable to unify "Type" with
 "forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)".
Level 4: Backtrace:

In environment
T : Type -> Type
M : Monad T
A : Type
P : nat -> A -> Type
Q : A -> Type
f : forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)
n : nat
a : A
l : list A
allq : ∥ All Q (a :: l) ∥
X : ∥ P n a ∥
Y : ∥ Alli P (S n) l ∥
Unable to unify "Type" with
 "forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)".
Level 4: Backtrace:

In environment
T : Type -> Type
M : Monad T
A : Type
P : nat -> A -> Type
Q : A -> Type
f : forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)
n : nat
a : A
l : list A
allq : ∥ All Q (a :: l) ∥
X : ∥ P n a ∥
Y : ∥ Alli P (S n) l ∥
Unable to unify "Type" with
 "forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)".
Level 3: Backtrace:

In environment
T : Type -> Type
M : Monad T
A : Type
P : nat -> A -> Type
Q : A -> Type
f : forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)
n : nat
a : A
l : list A
allq : ∥ All Q (a :: l) ∥
X : ∥ P n a ∥
Y : ∥ Alli P (S n) l ∥
Unable to unify "Type" with
 "forall (n : nat) (x : A), ∥ Q x ∥ -> T (∥ P n x ∥)".