proposition: Lemma uniquize_NoDupA {A} (beq : A -> A -> bool) (ls : list A) : NoDupA (fun x y => beq y x) (uniquize beq ls).
proof: Proof. induction ls as [|x xs IHxs]; simpl; [ solve [ constructor ] | ]. destruct (Equality.list_bin beq x (uniquize beq xs)) eqn:H; trivial. constructor; trivial. intro H'. apply Equality.list_inA_lb in H'. congruence. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Coq.Lists.SetoidList Coq.Bool.Bool Fiat.Common Fiat.Common.List.Operations Fiat.Common.Equality Fiat.Common.List.FlattenList Fiat.Common.LogicFacts