Goal:
  
  A : Type
  P : A → Prop
  Q : A → Prop
  a : A
  l : list A
  a0 : A
  l' : list A
  IHl : All P l → All Q l' → #|l| = #|l'| → All2 (λ x y : A, P x ∧ Q y) l l'
  p : P a
  ha : All P l
  x : A
  l0 : list A
  q : Q x
  hb : All Q l0
  ============================
   (a0 :: l' = x :: l0
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      S #|l| = S #|l'| → All2 (λ x y : A, P x ∧ Q y) (a :: l) (a0 :: 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