Goal:
  
  A : Type
  B : Type
  R : B → Type
  P : A → B → Type
  p : A → B → bool
  l : list A
  l' : list B
  X' : All (λ x : A, ∀ y : B, R y → reflectT (P x y) (p x y)) l
  XP : All R l'
  X : All2
        (λ (x : A) (y : B),
           (λ (x0 : A) (y0 : B),
              (λ x1 : A, ∀ y1 : B, R y1 → reflectT (P x1 y1) (p x1 y1)) x0
              × (λ (x1 : A) (y1 : B), p x1 y1) x0 y0) x y × 
           R y) l l'
  x : A
  y : B
  H : ∀ y : B, R y → reflectT (P x y) (p x y)
  __view_subject__ : is_true (p x y)
  ============================
   ((R y → P x y) → R 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 ]