Goal:
  
  A : Type
  t : A
  P : nat → A → A → Type
  i : nat
  tl : list A
  tl' : list A
  X : OnOne2i P (S i) tl tl'
  IHX : ∀ n : nat,
          nth_error tl n = Some t
          → ∑ t' : A,
              nth_error tl' n = Some t' × (t = t') + P (S i + n)%nat t t'
  ============================
   ((t = t) + P (i + 0)%nat t t)%type


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