Goal:
  
  A : Type
  P : A → Prop
  p : A → bool
  q : A → bool
  x : A
  l : list A
  H : P x
  H0 : Forall P l
  H1 : ∀ x : A, P x → p x = q x
  H2 : forallb p l = forallb q l
  ============================
   (p x && forallb p l = q x && forallb q 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