Goal:
  
  A : Type
  B : Type
  f : nat → A → B
  f' : nat → A → B
  g : B → bool
  g' : B → bool
  a : A
  l : list A
  IHl : ∀ n : nat,
          (∀ (n0 : nat) (x : A),
             nth_error l n0 = Some x → g (f (n + n0) x) → g' (f' (n + n0) x))
          → forallb g (mapi_rec f l n) → forallb g' (mapi_rec f' l n)
  n : nat
  hfg : ∀ (n0 : nat) (x : A),
          nth_error (a :: l) n0 = Some x
          → g (f (n + n0) x) → g' (f' (n + n0) x)
  hg : is_true (g' (f' n a))
  hf : is_true (forallb g (mapi_rec f l (S n)))
  H : ∀ x : A, nth_error (a :: l) 0 = Some x → g (f n x) → g' (f' n x)
  n0 : nat
  x : A
  H0 : nth_error l n0 = Some x
  H1 : is_true (g (f (S n + n0) x))
  ============================
   (nth_error l n0 = Some x)


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"