Goal:
  
  T : Type -> Type
  M : Monad T
  A : Type
  P : nat -> A -> Type
  l0 : list A
  k : nat
  f : forall (n : nat) (x : A),
      nth_error l0 n = Some x -> T (∥ P (k + n) x ∥)
  a : A
  l : list A
  Heq_l : a :: l = l0
  ============================
   (match l0 with
    | [] => None
    | x :: _ => Some x
    end = Some a)


DEBUG:Going to execute:
match goal with
           | H:?X = ?Y |- _ => subst X || subst Y
           end