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
  allq : All Q (a :: l)
  ============================
   (∥ Q a ∥)


DEBUG:Going to execute:
match goal with
           | H:∥ _ ∥ |- _ => case H; clear H; intro H
           end