Goal:
  
  A : Type
  B : Type
  R : nat → A → B → Type
  n : nat
  b0 : All2i R n [] []
  b'' : nat
  x : A
  y : B
  l : list A
  r : list B
  r0 : R b'' x y
  b : All2i R (S b'') l r
  ============================
   ({| pr1 := {| pr1 := n; pr2 := {| pr1 := []; pr2 := [] |} |}; pr2 := b0 |} =
    {|
      pr1 := {| pr1 := b''; pr2 := {| pr1 := x :: l; pr2 := y :: r |} |};
      pr2 := All2i_cons r0 b
    |}
    → ∀ (H := CoreTactics.block) (e : NoConfusionHom_All2i A B R n [] []
                                        All2i_nil b0),
        let H0 := CoreTactics.block in
        noConfusionHom_All2i_obligation_2 A B R n [] [] All2i_nil b0
          (noConfusionHom_All2i_obligation_1 A B R n [] [] All2i_nil b0 e) =
        e)


DEBUG:Going to execute:
match goal with
           | |- context [ eq_rect_r _ _ eq_refl ] => progress simpl eq_rect_r
           | |- context [ eq_rect _ _ _ _ eq_refl ] => progress simpl eq_rect
           | |- context [ Prop.Logic.transport _ eq_refl _ ] =>
                 progress simpl Prop.Logic.transport
           | |- context [ Logic.eq_elim _ _ _ _ _ eq_refl ] =>
                 progress simpl eq_rect
           | |- context [ Logic.eq_elim_r _ _ _ _ eq_refl ] =>
                 progress simpl Logic.eq_elim_r
           | |- context [ noConfusion_inv _ ] =>
                 progress simpl noConfusion_inv
           | |- DepElim.opaque_ind_pack_eq_inv ?G eq_refl =>
                 apply (DepElim.simplify_ind_pack_inv B x p G)
           | |- let _ := CoreTactics.block in _ => fail 1
           | |- _ => simplify * || simplify ?; cbv beta
           | |- _ → ?B =>
                 let ty := type of B in
                 intro || (let H := fresh in
                           intro
                           H)
           | |- ∀ x, _ => let H := fresh x in
                          intro
                          H
           | |- _ => intro
           end