Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
idtac
Level 2: Backtrace:

Tactic failure: No generalization needed.
Level 2: Backtrace:

Tactic failure: No generalization needed.
Level 2: Backtrace:

Tactic failure: No generalization needed.

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |} =
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})

  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
tac H

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |} =
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})

  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
DepElim.do_case hyp

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |} =
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})

  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
fun p =>
             DepElim.introduce p;
              DepElim.elim_case p || destruct p || (case p; clear p)

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |} =
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})

  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
DepElim.introduce p;
            DepElim.elim_case p || destruct p || (case p; clear p)

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |} =
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})

  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


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

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

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

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


Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |} =
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})

  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
fun p => first
             [ match p with
               | _ => generalize dependent p; intros p
               end
             | intros
             until
             p
             | intros
             until
             1
             | intros ]

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |} =
      {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})

  
  A : Type
  P : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  a : All2_fold P Γ Γ'
  p : P Γ Γ' d d'
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  ============================
   (let H := CoreTactics.block in
    NoConfusion_All2_fold A P
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
    → let H0 := CoreTactics.block in
      {|
        pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
        pr2 := All2_fold_cons P a p
      |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
first
[ match p with
  | _ => generalize dependent p; intros p
  end
| intros
until
p
| intros
until
1
| intros ]