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 :: Γ) × All_fold Q (d' :: Γ'))


DEBUG:Going to execute:
match reverse goal with
           | id:?X1
             |- _ =>
                 <Coq.Init.Tauto.is_conj> flags X1; elim id; do 2 intro;
                  clear id
           | id:_ ↔ _ |- _ => elim id; do 2 intro; clear id
           | id:¬ _ |- _ => red in id
           | id:?X1
             |- _ =>
                 <Coq.Init.Tauto.is_disj> flags X1; elim id; intro; clear id
           | _ =>
               <Coq.Init.Tauto.find_cut>
                ltac:(fun id0 id1 X2 =>
                        assert X2; [ exact (id0 id1) | clear id0 ])
           | id:?X1 → ?X2
             |- _ =>
                 <Coq.Init.Tauto.is_unit_or_eq> flags X1; Ltac.cut X2;
                  [ intro; clear id
                  | Ltac.cut X1; [ exact id | constructor 1; fail ] ]
           | id:?X1 → ?X2
             |- _ =>
                 <Coq.Init.Tauto.flatten_contravariant_conj> flags X1 X2 id
           | id:?X1 ↔ ?X2 → ?X3
             |- _ =>
                 assert ((X1 → X2) → (X2 → X1) → X3) by
                  (do 2 intro; apply id; Ltac.split; Ltac.assumption); clear
                  id
           | id:?X1 → ?X2
             |- _ =>
                 <Coq.Init.Tauto.flatten_contravariant_disj> flags X1 X2 id
           | |- ?X1 => <Coq.Init.Tauto.is_conj> flags X1; Ltac.split
           | |- _ ↔ _ => Ltac.split
           | |- ¬ _ => red
           end