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
  X : P n a
  q : Q a
  allq : All Q l
  ============================
   (All Q l)


DEBUG:Going to execute:
solve
[ trivial
with eq_true
| reflexivity
| symmetry; trivial
| contradiction
| congruence ]