Goal:
  
  A : Type
  B : Type
  C : Type
  R : A → C → Type
  g : A → B → C
  y : B
  ys : list B
  ============================
   (All2 (λ (x : A) (y : B), R x (g x y)) [] (y :: ys) → All2 R [] [])


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 ]