proposition: Lemma rev_append_rev : forall l l', rev_append l' l = rev l ++ l'.
proof: Proof. induction l; simpl; auto; intros. rewrite <- ass_app; fo. Qed.
imports: CoLoR(LogicUtil EqUtil RelUtil BoolUtil NatUtil) Coq(Setoid SetoidList FunInd)