proposition: Lemma map_id : forall {A: Type} (f:A -> A) x, (forall x, (f x = x)) -> map f x = x.
proof: Proof. destruct x; unfold map ; simpl. intros. congruence. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause