Goal:
  
  A : Type
  B : Type
  P : A → B → Prop
  Q : A → B → Prop
  x : A
  y : B
  l : list A
  l' : list B
  H : P x y
  H0 : Forall2 P l l'
  H1 : Forall (λ x : A, ∀ y : B, P x y → Q x y) (x :: l)
  x0 : A
  l0 : list A
  H4 : ∀ y : B, P x y → Q x y
  H5 : Forall (λ x : A, ∀ y : B, P x y → Q x y) l
  H2 : x0 = x
  H3 : l0 = l
  H6 : Forall2 Q l l'
  ============================
   (Q x y)


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.