Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  a : A
  Γ : list A
  Γ' : list A
  d : A
  d' : A
  Γ0 : list A
  Γ'0 : list A
  Hrel : All2_fold P Γ0 Γ'0
  p : P Γ0 Γ'0 d d'
  ============================
   ({| pr1 := a :: Γ; pr2 := Γ' |} = {| pr1 := d :: Γ0; pr2 := d' :: Γ'0 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      ∑ d' : A,
        nth_error Γ' 0 = Some d'
        × (let Γs := skipn 1 (a :: Γ) in
           let Γs' := skipn 1 Γ' in All2_fold P Γs Γs' × P Γs Γs' a d'))


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