Goal:
  
  A : Type
  B : Type
  f : A → B
  a : A
  l : list A
  p : B → bool
  IHl : ∀ (f : A → B) (p : B → bool),
          forallb p (map f l) = forallb (λ x : A, p (f x)) l
  ============================
   (p (f a) && forallb p (map f l) = p (f a) && forallb (λ x : A, p (f x)) l)


DEBUG:Going to execute:
match reverse goal with
           | |- ?X1 => <Coq.Init.Tauto.is_unit_or_eq> flags X1; constructor 1
           | H:?X1 |- _ => <Coq.Init.Tauto.is_empty> flags X1; elim H
           | _ => Ltac.assumption
           end