Ltac hypInv :=
      try (match goal with
          | [H: Some _ = Some _ |-_ ] => inversion H; clear H; subst
      end); try pairInv.Fixpoint lookupIndex (A : Set)(eqd : eq_dec A)(ls : list A)(a : A) def :=
  match ls with
    | nil => def
    | a' :: ls' =>
      if (eqd a a') then O else S (lookupIndex eqd ls' a def)
  end.

Lemma fold_add_nat_Permutation : forall (A : Set)(f : A -> nat)(ls1 ls2 : list A), Permutation ls1 ls2 -> fold_left (fun acc a => acc + (f a))%nat ls1 O = fold_left (fun acc a => acc + (f a))%nat ls2 O.