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 Γ Γ'
  ============================
   (P Γ d)


DEBUG:Going to execute:
<Coq.Init.Tauto.is_unit_or_eq> flags X1; Ltac.cut X2;
            [ intro; clear id
            | Ltac.cut X1; [ exact id | constructor 1; fail ] ]
Level 0: Backtrace:

Q is used in hypothesis X.
Level 0: Backtrace:

Q is used in hypothesis X.
Level 0: Backtrace:

Q is used in hypothesis X.
Level 0: Backtrace:

Q is used in hypothesis X.
Level 0: Backtrace:

Q is used in hypothesis X.
Level 1: Backtrace:

Q is used in hypothesis X.
Level 0: Backtrace:

Q is used in hypothesis X.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 1: Backtrace:

Not convertible.