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
  X : P n a
  allq1 : list A
  allq : All Q allq1
  ============================
   (a :: l = allq1 ->
    let H := CoreTactics.block in let H0 := CoreTactics.block in All Q l)


DEBUG:Going to execute:
fun id id' =>
             hnf in id;
              match type of id with
              | sigma _ =>
                  let xn := fresh id "'" in
                  destruct id as [xn id]; DepElim.decompose_exists xn id;
                   cbv beta iota delta [TODO projection TODO projection]
                    in id, id'; DepElim.decompose_exists id id'
              | _ =>
                  cbv beta iota delta [TODO projection TODO projection]
                   in id, id'
              end