Goal:
  
  A : Type
  B : Type
  R : nat → A → B → Type
  n : nat
  x : A
  y : B
  l : list A
  r : list B
  r0 : R n x y
  a : All2i R (S n) l r
  IHa : All2i
          (λ (i : nat) (x : A) (y : B),
             (if i <? S n then False else nth_error l (i - S n) = Some x)
             × R i x y) (S n) l r
  i : nat
  x0 : A
  y0 : B
  ltb : ¬ i < S n
  e : nth_error l (i - S n) = Some x0
  r1 : R i x0 y0
  ltb' : ¬ i < n
  ============================
   (Some x0 = Some x0 × R i x0 y0)


DEBUG:Going to execute:
let do_atom := solve
           [ trivial
           with eq_true
           | reflexivity
           | symmetry; trivial
           | contradiction
           | congruence ]
           in
           let rec do_ccl :=
            try do_atom; repeat (do_intro; try do_atom); try arith_congr;
             (solve [ split; do_ccl ])
           in
           (solve [ do_atom | use_hyps; do_ccl ]) ||
             fail "Cannot solve this goal"