Goal:
  
  A : Type
  f : nat → A
  m : nat
  n : nat
  IHm : ∀ n : nat, n < m ↔ nth_error (unfold m f) n = Some (f n)
  Hn : n < S m
  n0 : n ≠ m
  ============================
   (n = m)


DEBUG:Going to execute:
<coq-core.plugins.ltac::trivial@0> $1 $2

Goals:
  
  A : Type
  f : nat → A
  m : nat
  n : nat
  IHm : ∀ n : nat, n < m ↔ nth_error (unfold m f) n = Some (f n)
  Hn : n < S m
  n0 : n ≠ m
  ============================
   (n < m)

  
  A : Type
  f : nat → A
  m : nat
  n : nat
  IHm : ∀ n : nat, n < m ↔ nth_error (unfold m f) n = Some (f n)
  Hn : n < S m
  n0 : n ≠ m
  ============================
   (nth_error (unfold m f) n = Some (f n))


DEBUG:Going to execute:
try lia
Level 1: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 1: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No matching clauses for match.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 1: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.