Goal:
  
  A : Type
  B : Type
  P : A → B → Prop
  p : A → B → bool
  a : A
  l : list A
  b : B
  l' : list B
  Hp : ∀ (x : A) (y : B), reflect (P x y) (p x y)
  IHl : ∀ l' : list B, forallb2 p l l' → Forall2 P l l'
  H : is_true (p a b && forallb2 p l l')
  ============================
   (Forall2 P (a :: l) (b :: l'))


DEBUG:Going to execute:
match goal with
           | H:¬ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.