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


DEBUG:Going to execute:
DepElim.introduce p
Level 2: evaluation returns
DepElim.introduce p; DepElim.elim_case p || destruct p || (case p; clear p)
where
p := Hrel
of type
constr of type tacvalue

Level 1: evaluation returns
DepElim.introduce p; DepElim.elim_case p || destruct p || (case p; clear p)
where
p := Hrel
of type
constr of type tacvalue