Goal:
  
  A : Type
  P : list A → A → Type
  a : A
  Γ : list A
  Δ : list A
  X : All_fold P (Γ ++ Δ)
  p : P (Γ ++ Δ) a
  a0 : All_fold P Δ
  b : All_fold (λ Γ : list A, P (Γ ++ Δ)) Γ
  ============================
   (All_fold (λ Γ : list A, P (Γ ++ Δ)) Γ)


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:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 1: Backtrace:

P is used in conclusion.
Level 0: Backtrace:

P is used in conclusion.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 1: Backtrace:

Not convertible.