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 ∥
  ============================
   (∥ All Q l ∥)


DEBUG:Going to execute:
match goal with
           | H':?Y
             |- _ =>
                 match H with
                 | H' => fail 2
                 | _ => unify X Y; clear H' || clear H
                 end
           end