Goal:
    A : Type  B : Type  f : nat → A → B  l : list A
  ============================
   (List.rev (mapi (λ (k : nat) (x : A), f (#|l| - S k) x) l) =
    List.rev (mapi (λ (k : nat) (x : A), f (#|l| - S k) x) l))


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