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)
  ============================
   (let H := CoreTactics.block in let H0 := CoreTactics.block in Q a)


DEBUG:Going to execute:
fun id =>
             DepElim.generalize_sig id
              ltac:(fun id id' => DepElim.decompose_exists id id')