Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  Γ : list A
  Γ' : list A
  a : A
  Δ : list A
  a0 : A
  Δ' : list A
  H : #|Γ| = #|Γ'|
  IHΔ : All2_fold P Γ Γ'
        × All2_fold (λ Δ Δ' : list A, P (Δ ++ Γ) (Δ' ++ Γ')) Δ Δ'
  H' : All2_fold P (Δ ++ Γ) (Δ' ++ Γ')
  p : P (Δ ++ Γ) (Δ' ++ Γ') a a0
  ============================
   (All2_fold P Γ Γ'
    × All2_fold (λ Δ Δ' : list A, P (Δ ++ Γ) (Δ' ++ Γ')) (a :: Δ) (a0 :: Δ'))


DEBUG:Going to execute:
fun flags solver =>
             <Coq.Init.Tauto.tauto_intuit> flags
              ltac:(<Coq.Init.Tauto.reduction_not_iff>) solver