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'
  ha : All P (a :: l)
  ha0 := {| pr1 := a :: l; pr2 := ha |}
      : sigma (λ index : list A, All P index)
  ha1 := a :: l : list A
  ha2 := ha : (λ index : list A, All P index) ha1
  ============================
   (let H := CoreTactics.block in
    All Q (a0 :: l')
    → 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:
generalize (eq_refl : t = id'1); clearbody id'2 id'1; clear id' id;
            try unfold signature in id'2; hnf in id'2; 
            simpl in id'2; rename id'2 into id; cont id id id'1 t
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.
Level 2: Backtrace:

ha is used in conclusion.