Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  Q : list A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  X : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  IHX : All_fold Q Γ
        → All_fold Q Γ'
          → All2_fold
              (λ (Γ Γ' : list A) (x y : A), Q Γ x × Q Γ' y × P Γ Γ' x y) Γ Γ'
  d0 : A
  Γ0 : list A
  l : All_fold Q Γ0
  q : Q Γ0 d0
  ============================
   (d :: Γ = d0 :: Γ0
    → let H := CoreTactics.block in
      All_fold Q (d' :: Γ')
      → let H0 := CoreTactics.block in
        All2_fold (λ (Γ Γ' : list A) (x y : A), Q Γ x × Q Γ' y × P Γ Γ' x y)
          (d :: Γ) (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