Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  idx0 : list A
  idx : list A
  a : All2_fold P idx0 idx
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := idx0; pr2 := idx |}; pr2 := a |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| pr1 := {| pr1 := idx0; pr2 := idx |}; pr2 := a |} =
    {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
destruct a
Level 3: evaluation returns
idtac 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
DepElim.depelim b

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
fun id =>
             DepElim.do_depelim ltac:(fun hyp => DepElim.do_case hyp) id

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      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_depelim ltac:(fun hyp => DepElim.do_case hyp) id

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
fun tac H =>
             DepElim.do_depelim_nosimpl tac H; DepElim.simpl_dep_elim;
              CoreTactics.unblock_goal

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
fun hyp => 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      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_depelim_nosimpl tac H; DepElim.simpl_dep_elim;
            CoreTactics.unblock_goal

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      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_depelim_nosimpl tac H; DepElim.simpl_dep_elim
Level 4: evaluation returns
DepElim.do_depelim_nosimpl tac H; DepElim.simpl_dep_elim;
 CoreTactics.unblock_goal
where
tac := fun hyp => DepElim.do_case hyp
       where
       id := b
       of type
       constr
of type
tacvalue
H := b
of type
constr of type tacvalue

Level 4: evaluation returns
DepElim.do_depelim_nosimpl tac H; DepElim.simpl_dep_elim;
 CoreTactics.unblock_goal
where
tac := fun hyp => DepElim.do_case hyp
       where
       id := b
       of type
       constr
of type
tacvalue
H := b
of type
constr of type tacvalue

Level 3: evaluation returns
DepElim.do_depelim_nosimpl tac H; DepElim.simpl_dep_elim;
 CoreTactics.unblock_goal
where
tac := fun hyp => DepElim.do_case hyp
       where
       id := b
       of type
       constr
of type
tacvalue
H := b
of type
constr of type tacvalue

Level 3: evaluation returns
DepElim.do_depelim_nosimpl tac H; DepElim.simpl_dep_elim;
 CoreTactics.unblock_goal
where
tac := fun hyp => DepElim.do_case hyp
       where
       id := b
       of type
       constr
of type
tacvalue
H := 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      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_depelim_nosimpl 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
fun tac H =>
             DepElim.do_intros H; DepElim.generalize_by_eqs H; 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      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_intros H; DepElim.generalize_by_eqs H; 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      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_intros H; DepElim.generalize_by_eqs H
Level 3: evaluation returns
DepElim.do_intros H; DepElim.generalize_by_eqs H; tac H
where
tac := fun hyp => DepElim.do_case hyp
       where
       id := b
       of type
       constr
of type
tacvalue
H := b
of type
constr of type tacvalue

Level 3: evaluation returns
DepElim.do_intros H; DepElim.generalize_by_eqs H; tac H
where
tac := fun hyp => DepElim.do_case hyp
       where
       id := b
       of type
       constr
of type
tacvalue
H := 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      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_intros H

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
fun H =>
             try intros until H; intro_block_id H || intro_block H;
              (try simpl in H; DepElim.simplify_equations_in H)

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
try intros until H; intro_block_id H || intro_block H;
            (try simpl in H; DepElim.simplify_equations_in H)

Goals:
  
  A : Type
  P : list A → list A → A → A → Type
  idx2 : list A
  idx1 : list A
  b : All2_fold P idx2 idx1
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
try intros until H; intro_block_id H || intro_block H
Level 3: evaluation returns
try intros until H; intro_block_id H || intro_block H;
 (try simpl in H; DepElim.simplify_equations_in H)
where
H := b
of type
constr of type tacvalue

Level 3: evaluation returns
try intros until H; intro_block_id H || intro_block H;
 (try simpl in H; DepElim.simplify_equations_in H)
where
H := 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
  H : NoConfusion_All2_fold A P
        {| pr1 := {| pr1 := []; pr2 := [] |}; pr2 := All2_fold_nil P |}
        {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({| 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
  H : NoConfusion_All2_fold A P
        {|
          pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
          pr2 := All2_fold_cons P a p
        |} {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |}
  ============================
   ({|
      pr1 := {| pr1 := d :: Γ; pr2 := d' :: Γ' |};
      pr2 := All2_fold_cons P a p
    |} = {| pr1 := {| pr1 := idx2; pr2 := idx1 |}; pr2 := b |})


DEBUG:Going to execute:
try intros until H