Goal:
  
  T : Type -> Type
  M : Monad T
  A : Type
  P : A -> Type
  Q : A -> Type
  f : forall x : A, ∥ Q x ∥ -> T (∥ P x ∥)
  l0 : list A
  a : A
  l : list A
  X : P a
  allq : All Q (a :: l)
  ============================
   (All Q l)


DEBUG:Going to execute:
DepElim.do_intros H; DepElim.generalize_by_eqs H
Level 1: evaluation returns
DepElim.do_intros H; DepElim.generalize_by_eqs H; tac H
where
tac := fun hyp => DepElim.do_case hyp
       where
       id := allq
       of type
       constr
of type
tacvalue
H := allq
of type
constr of type tacvalue