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


DEBUG:Going to execute:
apply : eq_sym ; trivial
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.