Goal:
  
  A : Type
  P : A → Prop
  p : A → bool
  x : A
  l : list A
  H : P x
  H0 : Forall P l
  IHForall : ∀ p : A → bool, (∀ x : A, P x → p x) → forallb p l
  H1 : ∀ x : A, P x → p x
  ============================
   (is_true (p x))


DEBUG:Going to execute:
match reverse goal with
           | id:(?X1 → ?X2) → ?X3
             |- _ =>
                 Ltac.cut X3;
                  [ intro; clear id; t_tauto_intuit
                  | Ltac.cut (X1 → X2);
                     [ exact
                     id
                     | generalize (λ y : X2, id (λ x : X1, y)); intro; clear
                        id; (solve [ t_tauto_intuit ]) ] ]
           | id:¬ ?X1 → ?X3
             |- _ =>
                 Ltac.cut X3;
                  [ intro; clear id; t_tauto_intuit
                  | Ltac.cut (¬ X1);
                     [ exact
                     id
                     | clear id; intro; (solve [ t_tauto_intuit ]) ] ]
           | |- ?X1 =>
                 <Coq.Init.Tauto.is_disj> flags X1; (solve
                  [ Ltac.left; t_tauto_intuit | Ltac.right; t_tauto_intuit ])
           end ||
             match goal with
             | |- _ → _ => intro; t_tauto_intuit
             | |- _ => t_reduce; t_solver
             end || t_solver
Level 3: Backtrace:

No such assumption.
Level 2: Backtrace:

No such assumption.
Level 1: Backtrace:

No such assumption.
Level 1: evaluation raised the exception
Backtrace:

No such assumption.

Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.