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


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