Goal:
  
  A : Type
  B : Type
  f : nat → A → bool
  g : nat → B → A
  a : B
  l : list B
  IHl : ∀ n : nat,
          alli f n (mapi_rec g l n) =
          alli (λ (i : nat) (x : B), f i (g i x)) n l
  n : nat
  ============================
   (f n (g n a) && alli (λ (i : nat) (x : B), f i (g i x)) (S n) l =
    f n (g n a) && alli (λ (i : nat) (x : B), f i (g i x)) (S n) l)


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"