proposition: Lemma in_rev_map_iff: forall [A B : Type] (f : A -> B) (l : list A) (y : B), In y (rev_map f l) <-> (exists x : A, f x = y /\ In x l).
proof: Proof. unfold rev_map. intros. rewrite in_xrev_map_iff. simpl. tauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause