Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  Q : list A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  X : All2_fold (λ (Γ Γ' : list A) (x y : A), Q Γ x × Q Γ' y × P Γ Γ' x y) Γ
        Γ'
  a : Q Γ d
  a0 : All2_fold P Γ Γ'
  a1 : Q Γ' d'
  b1 : P Γ Γ' d d'
  a2 : All_fold Q Γ
  b : All_fold Q Γ'
  ============================
   (All_fold Q (d :: Γ))


DEBUG:Going to execute:
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