Goal:
  
  A : Type
  x : A
  xs : list A
  f : A → bool
  H0 : ∀ f0 : A → bool,
         (λ (x : A) (_ : In x xs), f x) = (λ (x : A) (_ : In x xs), f0 x)
         → forallb_InP xs (λ (x : A) (_ : In x xs), f x) = forallb f0 xs
  ============================
   ((λ (x : A) (_ : In x xs), f x) = λ (x : A) (_ : In x xs), f x)


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"