Goal:
  
  A : Type
  P : A → bool
  l : list A
  x : A
  a : A
  l0 : list A
  IHl0 : fold_right (λ (y : A) (x : bool), P y && x) (P x) l0 =
         P x && forallb P l0
  ============================
   (P x && P a = P x && P a)


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