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:
<Coq.Init.Tauto.is_unit_or_eq> flags X1; Ltac.cut X2;
            [ intro; clear id
            | Ltac.cut X1; [ exact id | constructor 1; fail ] ]
Level 0: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 1: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 1: Backtrace:

Not convertible.