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 : ∀ x : A, nth_error (a :: l) 0 = Some x → g (f n x) = g' (f' n x)
  ============================
   (nth_error (a :: l) 0 = Some a)


DEBUG:Going to execute:
solve
[ trivial
with eq_true
| reflexivity
| symmetry; trivial
| contradiction
| congruence ]