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


DEBUG:Going to execute:
match goal with
           | |- context [ rew <- [_] eq_refl in _ ] =>
                 progress simpl eq_rect_r
           | |- context [ rew [_] eq_refl in _ ] => progress simpl eq_rect
           | |- context [ Prop.Logic.transport _ eq_refl _ ] =>
                 progress simpl Prop.Logic.transport
           | |- context [ Logic.eq_elim _ _ _ _ _ eq_refl ] =>
                 progress simpl eq_rect
           | |- context [ Logic.eq_elim_r _ _ _ _ eq_refl ] =>
                 progress simpl Logic.eq_elim_r
           | |- context [ noConfusion_inv _ ] =>
                 progress simpl noConfusion_inv
           | |- DepElim.opaque_ind_pack_eq_inv ?G eq_refl =>
                 apply (DepElim.simplify_ind_pack_inv B x p G)
           | |- let _ := CoreTactics.block in _ => fail 1
           | |- _ => simplify * || simplify ?; cbv beta
           | |- _ → ?B =>
                 let ty := type of B in
                 intro || (let H := fresh in
                           intro
                           H)
           | |- ∀ x, _ => let H := fresh x in
                          intro
                          H
           | |- _ => intro
           end