Goal:
  
  A : Type
  B : Type
  f : A → B
  n : nat
  a : A
  l : list A
  l0 : list A
  l1 : list A
  IHn : chop n (map f l) = (map f l0, map f l1)
  Heq : chop n l = (l0, l1)
  ============================
   ((f a :: map f l0, map f l1) = (map f (a :: l0), map f l1))


DEBUG:Going to execute:
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"