Goal:
  
  T : Type -> Type
  M : Monad T
  A : Type
  P : nat -> A -> Type
  f : forall (n : nat) (x : A), T (∥ P n x ∥)
  l0 : list A
  n : nat
  a : A
  l : list A
  Heq_l : a :: l = l0
  X : ∥ P n a ∥
  Y : ∥ Alli P (S n) l ∥
  ============================
   (∥ Alli P n (a :: l) ∥)


DEBUG:Going to execute:
match goal with
           | H:exists y, _ y |- _ => tac H
           | H:{x : _ | ?P x} |- _ => tac H
           | H:{x : _ & ?P x} |- _ => tacT H
           | H:exists2 x : _, _ x & _ x |- _ => tac2 H
           | H:{x : _ | ?P x & _ x} |- _ => tac2 H
           | H:{x : _ & ?P x & _ x} |- _ => tacT2 H
           end