Goal:
  
  A : Type
  P : A → Prop
  Q : A → Prop
  p : A → bool
  x : A
  l : list A
  H : Q x
  HQ : Forall Q l
  Hp : ∀ x : A, Q x → reflect (P x) (p x)
  IHHQ : forallb p l = true → Forall P l
  ============================
   (p x && forallb p l = true → Forall P (x :: l))


DEBUG:Going to execute:
trivial; hnf; intros; (solve
            [ do
            ![ solve
             [ trivial | apply : eq_sym ; trivial ]
             | discriminate
             | contradiction
             | Ltac.split ]
            | case not_locked_false_eq_true; Ltac.assumption
            | match goal with
              | H:¬ _ |- _ => solve [ case H; trivial ]
              end ])