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 ∥)
  ============================
   (nat -> forall (a : A) (l : list A), ∥ All Q (a :: l) ∥ -> ∥ Q a ∥)


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