Goal:
  
  A : Type
  B : Type
  P : A → B → Prop
  p : A → B → bool
  b : B
  l' : list B
  Hp : ∀ (x : A) (y : B), reflect (P x y) (p x y)
  ============================
   (false → Forall2 P [] (b :: l'))


DEBUG:Going to execute:
trivial; hnf; intros; (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 ])