Goal:
  
  A : Type
  P : nat → A → Type
  k : nat
  l : list A
  alli : Alli (λ k' : nat, P (Nat.pred #|l| - k' + k)) 0 l
  ============================
   (Alli (λ k' : nat, P (Nat.pred #|l| - k' + k)) 0 l)


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