Goal:
  
  A : Type
  P : A → A → Type
  a : A
  l : list A
  l' : list A
  f : A → A
  hp : ∀ x y : A, P (f x) y → ∑ y' : A, y = f y'
  IHl : ∀ l' : list A,
          OnOne2 P (map f l) l'
          → ∑ l'' : list A, OnOne2 (λ x y : A, P (f x) (f y)) l l''
  hd : A
  hd' : A
  tl : list A
  p : P hd hd'
  ============================
   ({| pr1 := f a :: map f l; pr2 := l' |} =
    {| pr1 := hd :: tl; pr2 := hd' :: tl |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      ∑ l'' : list A, OnOne2 (λ x y : A, P (f x) (f y)) (a :: l) 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