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)
  ============================
   (Q a)


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