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


DEBUG:Going to execute:
<coq-equations.plugin::simplify@0> $1