Goal:
  
  X : Type
  Y : Type
  R : nat → X → Y → Type
  n : nat
  a0 : X
  xs : list X
  xs' : list X
  l : list Y
  a2' : nat
  a2'0 : list X
  a2 : list Y
  a : All2i R a2' a2'0 a2
  ============================
   ({| pr1 := n; pr2 := {| pr1 := a0 :: xs ++ xs'; pr2 := l |} |} =
    {| pr1 := a2'; pr2 := {| pr1 := a2'0; pr2 := a2 |} |}
    → let H := CoreTactics.block in
      (∀ (n : nat) (xs' : list X) (l : list Y),
         All2i R n (xs ++ xs') l
         → ∑ ys ys' : list Y,
             l = ys ++ ys' × All2i R n xs ys × All2i R (n + #|xs|) xs' ys')
      → let H0 := CoreTactics.block in
        ∑ ys ys' : list Y,
          l = ys ++ ys'
          × All2i R n (a0 :: xs) ys × All2i R (n + #|a0 :: xs|) xs' ys')


DEBUG:Going to execute:
first
[ match p with
  | _ => generalize dependent p; intros p
  end
| intros
until
p
| intros
until
1
| intros ]