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


DEBUG:Going to execute:
solve
[ red; intros; Tactics.destruct_conjs; Tactics.autoinjections;
   Tactics.discriminates ]