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 P Δ)


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