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


DEBUG:Going to execute:
simplify ?
Level 2: Backtrace:

The first hypothesis in the goal is not an equality.
Level 2: Backtrace:

The first hypothesis in the goal is not an equality.