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 ∥)
  l0 : list A
  n : nat
  a : A
  l : list A
  Heq_l : a :: l = l0
  allq : ∥ All Q (a :: l) ∥
  ============================
   (∥ Q a ∥)


DEBUG:Going to execute:
unfold Tactics.fix_proto in *
Level 1: Backtrace:

No matching clauses for match.
Level 0: Backtrace:

No matching clauses for match.