Ltac prog_assoc_r :=
    eapply comp_spec_eq_trans_r; [ idtac | eapply comp_spec_assoc].(* A bounded repeat based on fold. *)
Definition repeatMax(A : Set)(eqd : EqDec A)(c : Comp A)(P : A -> bool) def (n : nat):=
  compFold _ (fun a' i => if (P a') then (ret a') else c) def (allNatsLt n).

Theorem list_pred_rev : forall (A B : Set)(lsa : list A)(lsb : list B) P, list_pred P lsa lsb -> forall a b, P a b -> list_pred P (lsa ++ (a :: nil)) (lsb ++ (b :: nil)).