Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  a : A
  Γ : list A
  Γ' : list A
  Hrel1 : sigma (λ _ : list A, list A)
  Hrel : All2_fold P (pr1 Hrel1) (pr2 Hrel1)
  ============================
   ({| pr1 := a :: Γ; pr2 := Γ' |} = Hrel1
    → 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:
try rename id into id',id' into id
Level 3: evaluation returns
try rename id into id',id' into id; cont id'1 id
where
t := {| pr1 := a :: Γ; pr2 := Γ' |}
of type
constr
id'1 := Hrel1
of type
constr
id' := Hrel
of type
constr
id := Hrel
of type
constr
cont := fun id id' => DepElim.decompose_exists id id'
        where
        id := Hrel
        of type
        constr
of type
tacvalue of type tacvalue