Goal:
  
  A : Type
  B : Type
  p : A → B → bool
  a : A
  l : list A
  b : B
  l' : list B
  q : list A
  q' : list B
  IHl : ∀ l' : list B,
          forallb2 p l l' && forallb2 p q q' → forallb2 p (l ++ q) (l' ++ q')
  pa : is_true (p a b)
  pl : is_true (forallb2 p l l')
  pq : is_true (forallb2 p q q')
  ============================
   (forallb2 p l l' && forallb2 p q q' = true)


DEBUG:Going to execute:
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 ]