Goal:
  
  A : Type
  f : nat → A
  m : nat
  t : A
  IHm : ∀ n : nat, nth_error (unfold m f) n = Some t → t = f n
  H : m < m + 1
  Hn : nth_error [f m] (m - m) = Some t
  ============================
   (t = f m)


DEBUG:Going to execute:
match goal with
           | H:¬ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.