Goal:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  X : All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ d × Q Γ Γ' d d') Γ Γ'
  a : P Γ d
  b : Q Γ Γ' d d'
  a0 : All_fold P Γ
  b0 : All2_fold Q Γ Γ'
  ============================
   (All2_fold Q Γ Γ')


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