Goal:
  
  A : Type
  P : nat → A → A → Type
  i : nat
  hd : A
  tl : list A
  tl' : list A
  h : OnOne2i P (S i) tl tl'
  i' : nat
  x : A
  y : A
  u : list A
  v : list A
  a : P i' x y
  H : tl = u ++ x :: v
  H0 : tl' = u ++ y :: v
  ============================
   (hd :: tl' = (hd :: u) ++ y :: v)


DEBUG:Going to execute:
fun flags =>
             match reverse goal with
             | |- ?X1 =>
                   <Coq.Init.Tauto.is_unit_or_eq> flags X1; constructor 1
             | H:?X1 |- _ => <Coq.Init.Tauto.is_empty> flags X1; elim H
             | _ => Ltac.assumption
             end