Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  Γ : list A
  Γ' : list A
  a : A
  Δ : list A
  a0 : A
  Δ' : list A
  H : #|Γ| = #|Γ'|
  H' : All2_fold P (Δ ++ Γ) (Δ' ++ Γ')
  p : P (Δ ++ Γ) (Δ' ++ Γ') a a0
  a1 : All2_fold P Γ Γ'
  b : All2_fold (λ Δ Δ' : list A, P (Δ ++ Γ) (Δ' ++ Γ')) Δ Δ'
  ============================
   (All2_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