Goal:
  
  A : Type
  B : Type
  C : Type
  R : A → C → Type
  g : A → B → C
  x : A
  xs : list A
  ih : ∀ l' : list B,
         All2 (λ (x : A) (y : B), R x (g x y)) xs l'
         → All2 R xs (map2 g xs l')
  X : All2 (λ (x : A) (y : B), R x (g x y)) (x :: xs) []
  ============================
   (All2 R (x :: xs) [])


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 ]