Goal:
  
  A : Type
  f : nat → A
  n : nat
  i : nat
  hf : ∀ i j : nat, f i = f j → i = j
  IHn : In (f i) (unfold n f) → i < n
  H : In (f i) (unfold n f ++ [f n])
  ============================
   (i < S n)


DEBUG:Going to execute:
solve
[ do
![ solve
 [ trivial | apply : eq_sym ; trivial ]
 | discriminate
 | contradiction
 | Ltac.split ]
| case not_locked_false_eq_true; Ltac.assumption
| match goal with
  | H:¬ _ |- _ => solve [ case H; trivial ]
  end ]