Goal:
  
  A : Type
  B : Type
  f : A → B
  a : A
  l : list A
  IHl : ∀ l0 : list B,
          (fix aux (l : list A) (acc : list B) {struct l} : list B :=
             match l with
             | [] => acc
             | x :: l1 => aux l1 (f x :: acc)
             end) l l0 = List.rev (map f l) ++ l0
  l0 : list B
  ============================
   (List.rev (map f l) ++ f a :: l0 = List.rev (map f l) ++ [f a] ++ l0)


DEBUG:Going to execute:
let rec use_hyp H :=
            match type of H with
            | _ ∧ _ => exact H || destruct_hyp H
            | _ * _ => exact H || destruct_hyp H
            | _ => try (solve [ inversion H ])
            end
           with do_intro := let H := fresh in
                            intro H; use_hyp H
           with destruct_hyp H := case H; clear H; do_intro; do_intro
           in
           let rec use_hyps :=
            match goal with
            | H:_ ∧ _ |- _ => exact H || (destruct_hyp H; use_hyps)
            | H:_ * _ |- _ => exact H || (destruct_hyp H; use_hyps)
            | H:_ |- _ => solve [ inversion H ]
            | _ => idtac
            end
           in
           let do_atom := solve
           [ trivial
           with eq_true
           | reflexivity
           | symmetry; trivial
           | contradiction
           | congruence ]
           in
           let rec do_ccl :=
            try do_atom; repeat (do_intro; try do_atom); try arith_congr;
             (solve [ split; do_ccl ])
           in
           (solve [ do_atom | use_hyps; do_ccl ]) ||
             fail "Cannot solve this goal"