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)
  allq0 := {| pr1 := a :: l; pr2 := allq |}
        : sigma (fun index : list A => All Q index)
  ============================
   (let H := CoreTactics.block in let H0 := CoreTactics.block in Q a)


DEBUG:Going to execute:
let id'1 := fresh id' in
           let id'2 := fresh id' in
           set (id'2 := pr2 id'); set (id'1 := pr1 id') in id'2;
            hnf in (value of id'1), (value of id'2);
            try red in (type of id'2);
            match goal with
            | id'1:=?t:_
              |- _ =>
                  generalize (eq_refl : t = id'1); clearbody id'2 id'1; clear
                   id' id; try unfold signature in id'2; 
                   hnf in id'2; simpl in id'2; rename id'2 into id;
                   cont id id id'1 t
            end