Goal:
  
  A : Type
  B : Type
  C : Type
  P : A → B → C → Type
  a : C
  ls1 : list C
  IH : ∀ (ls2 : list A) (ls3 : list B),
         All2 (λ (x : A) (y : B), All (P x y) ls1) ls2 ls3
         → All (λ z : C, All2 (λ (x : A) (y : B), P x y z) ls2 ls3) ls1
  a0 : A
  ls2 : list A
  b : B
  ls3 : list B
  X1 : All2 (λ (x : A) (y : B), All (P x y) (a :: ls1)) ls2 ls3
  X : P a0 b a
  X2 : All (P a0 b) ls1
  x : C
  ============================
   (P a0 b x)


DEBUG:Going to execute:
contradiction
Level 1: Backtrace:

 The relation (P a0) is not a declared symmetric relation. Maybe you need to require the Coq.Classes.RelationClasses library
Level 0: Backtrace:

 The relation (P a0) is not a declared symmetric relation. Maybe you need to require the Coq.Classes.RelationClasses library
Level 0: Backtrace:

 The relation (P a0) is not a declared symmetric relation. Maybe you need to require the Coq.Classes.RelationClasses library