Goal:
  
  A : Type
  B : Type
  C : Type
  D : Type
  R : C → D → Type
  f : A → C
  g : B → D
  a : A
  l : list A
  b : B
  l' : list B
  IHl : ∀ l' : list B,
          All2 R (map f l) (map g l')
          → All2 (λ (x : A) (y : B), R (f x) (g y)) l l'
  ============================
   ({| pr1 := f a :: map f l; pr2 := g b :: map g l' |} =
    {| pr1 := []; pr2 := [] |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2 (λ (x : A) (y : B), R (f x) (g y)) (a :: l) (b :: l'))


DEBUG:Going to execute:
match goal with
           | |- context [ rew <- [_] eq_refl in _ ] =>
                 progress simpl eq_rect_r
           | |- context [ rew [_] eq_refl in _ ] => 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