Goal:
  
  A : Type
  B : Type
  C : Type
  R : A → C → Type
  g : A → B → C
  y : B
  ys : list B
  H : 0 = S #|ys|
  X : All2 R [] []
  ============================
   (All2 (λ (x : A) (y : B), R x (g x y)) [] (y :: ys))


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 ]