Goal:
  
  A : Type
  B : Type
  P : A → nat → B → Type
  a : A
  ls2 : list A
  n : nat
  X : Alli (λ (n : nat) (y : B), All (λ x : A, P x n y) (a :: ls2)) n []
  ============================
   (All (λ x : A, Alli (P x) n []) ls2)


DEBUG:Going to execute:
solve
[ trivial
with eq_true
| reflexivity
| symmetry; trivial
| contradiction
| congruence ]