Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  n : nat
  a : A
  Γ : list 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')
  Hrel : All2_fold P (a :: Γ) Γ'
  H : nth_error (a :: Γ) (S n) = Some d
  ============================
   (let H := CoreTactics.block in
    let H0 := CoreTactics.block in
    ∑ d' : A,
      nth_error Γ' (S n) = Some d'
      × (let Γs := skipn (S (S n)) (a :: Γ) in
         let Γs' := skipn (S (S n)) Γ' in All2_fold P Γs Γs' × P Γs Γs' d d'))


DEBUG:Going to execute:
<coq-core.plugins.ltac::revert@0> $1
Level 3: evaluation returns
revert H'
where
H' := H
of type
constr
H := H
of type
ident of type tacvalue


Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  Γ' : list A
  d : A
  Hrel : All2_fold P [] Γ'
  ============================
   (nth_error [] 0 = Some d
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      ∑ d' : A,
        nth_error Γ' 0 = Some d'
        × (let Γs := skipn 1 [] in
           let Γs' := skipn 1 Γ' in All2_fold P Γs Γs' × P Γs Γs' d d'))

  
  A : Type
  P : list A → list A → A → A → Type
  a : A
  Γ : list A
  Γ' : list A
  d : A
  Hrel : All2_fold P (a :: Γ) Γ'
  ============================
   (nth_error (a :: Γ) 0 = Some d
    → 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' d d'))

  
  A : Type
  P : list A → list A → A → A → Type
  n : nat
  Γ' : 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')
  Hrel : All2_fold P [] Γ'
  ============================
   (nth_error [] (S n) = Some d
    → let H := CoreTactics.block in
      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)) Γ' in
           All2_fold P Γs Γs' × P Γs Γs' d d'))

  
  A : Type
  P : list A → list A → A → A → Type
  n : nat
  a : A
  Γ : list 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')
  Hrel : All2_fold P (a :: Γ) Γ'
  ============================
   (nth_error (a :: Γ) (S n) = Some d
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      ∑ d' : A,
        nth_error Γ' (S n) = Some d'
        × (let Γs := skipn (S (S n)) (a :: Γ) in
           let Γs' := skipn (S (S n)) Γ' in
           All2_fold P Γs Γs' × P Γs Γs' d d'))


DEBUG:Going to execute:
DepElim.simplify_dep_elim
Level 1: evaluation returns
idtac of type tacvalue

Level 1: evaluation returns
idtac of type tacvalue

Level 1: evaluation returns
idtac of type tacvalue

Level 1: evaluation returns
idtac of type tacvalue


Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  Γ' : list A
  d : A
  Hrel : All2_fold P [] Γ'
  ============================
   (nth_error [] 0 = Some d
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      ∑ d' : A,
        nth_error Γ' 0 = Some d'
        × (let Γs := skipn 1 [] in
           let Γs' := skipn 1 Γ' in All2_fold P Γs Γs' × P Γs Γs' d d'))

  
  A : Type
  P : list A → list A → A → A → Type
  a : A
  Γ : list A
  Γ' : list A
  d : A
  Hrel : All2_fold P (a :: Γ) Γ'
  ============================
   (nth_error (a :: Γ) 0 = Some d
    → 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' d d'))

  
  A : Type
  P : list A → list A → A → A → Type
  n : nat
  Γ' : 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')
  Hrel : All2_fold P [] Γ'
  ============================
   (nth_error [] (S n) = Some d
    → let H := CoreTactics.block in
      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)) Γ' in
           All2_fold P Γs Γs' × P Γs Γs' d d'))

  
  A : Type
  P : list A → list A → A → A → Type
  n : nat
  a : A
  Γ : list 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')
  Hrel : All2_fold P (a :: Γ) Γ'
  ============================
   (nth_error (a :: Γ) (S n) = Some d
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      ∑ d' : A,
        nth_error Γ' (S n) = Some d'
        × (let Γs := skipn (S (S n)) (a :: Γ) in
           let Γs' := skipn (S (S n)) Γ' in
           All2_fold P Γs Γs' × P Γs Γs' d d'))


DEBUG:Going to execute:
repeat DepElim.simplify_one_dep_elim