Goal:
  
  A : Type
  P : A → Type
  Q : A → Type
  x : A
  l : list A
  p : P x
  Hl : All P l
  q : Q x
  Hl' : All Q l
  X : All (λ x : A, P x × Q x) l
  ============================
   (All (λ x : A, P x × Q x) (x :: l))


DEBUG:Going to execute:
fun flags =>
             match reverse goal with
             | |- ?X1 =>
                   <Coq.Init.Tauto.is_unit_or_eq> flags X1; constructor 1
             | H:?X1 |- _ => <Coq.Init.Tauto.is_empty> flags X1; elim H
             | _ => Ltac.assumption
             end