Goal:
  
  A : Type
  B : Type
  P : A → nat → B → Type
  a : B
  ls1 : list B
  a0 : A
  ls2 : list A
  n : nat
  X2 : Alli (P a0) (S n) ls1
  X3 : All (λ x : A, Alli (P x) (S n) ls1) ls2
  X1 : P a0 n a
  X4 : All (λ x : A, P x n a) ls2
  X0 : All (λ x : A, P x n a) (a0 :: ls2)
  X5 : Alli (λ (n : nat) (y : B), All (λ x : A, P x n y) (a0 :: ls2)) 
         (S n) ls1
  ============================
   (All (λ x : A, Alli (P x) n (a :: ls1)) ls2)


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

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

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

 The relation All is not a declared symmetric relation. Maybe you need to require the Coq.Classes.RelationClasses library