Goal:
  
  A : Type
  B : Type
  a : A
  l : list A
  f : A → B
  g : A → B
  IHl : map f l = map g l → Forall (λ x : A, f x = g x) l
  H : f a :: map f l = g a :: map g l
  ============================
   (Forall (λ x : A, f x = g x) (a :: l))


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 ]