Goal:
  
  A : Type
  B : Type
  P : A → B → Type
  p : A → B → bool
  l : list A
  l' : list B
  H : ∀ (x : A) (y : B), reflectT (P x y) (p x y)
  X : All2 (λ (x : A) (y : B), p x y) l l'
  x : A
  y : B
  __view_subject__ : is_true (p x y)
  ============================
   (P x y → P x y)


DEBUG:Going to execute:
<coq-core.plugins.ltac::trivial@0> $1 $2

Goals:

DEBUG:Going to execute:
hnf

Goals:

DEBUG:Going to execute:
intros

Goals:

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 ]