Goal:
    A : Type  B : Type  f : nat → A → B  a : A  l : list A
  ============================
   (f 0 a :: mapi_rec (λ (n : nat) (x : A), f (S n) x) l 0 =
    f 0 a :: mapi_rec (λ x : nat, f (S x)) l 0)


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