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


DEBUG:Going to execute:
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
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.
Level 2: Backtrace:

allq is used in conclusion.