Goal:
  
  A : Type
  P : A → Prop
  Q : A → Prop
  a : A
  l : list A
  a0 : A
  l' : list A
  IHl : ∀ l' : list A,
          All P l
          → All Q l' → #|l| = #|l'| → All2 (λ x y : A, P x ∧ Q y) l l'
  X : All P (a :: l)
  X0 : All Q (a0 :: l')
  H : S #|l| = S #|l'|
  ============================
   (All2 (λ x y : A, P x ∧ Q y) (a :: l) (a0 :: l'))


DEBUG:Going to execute:
match goal with
           | H:¬ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.