proposition: Lemma xmap_rev : forall [A B: Type] (f: A -> B) (l:list A) (r:list B), xrev_map f r l = (List.map f (List.rev l)) ++ r.
proof: Proof. induction l; simpl. - auto. - intros. rewrite IHl. rewrite List.map_app. simpl. rewrite <- app_assoc. reflexivity. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause