proposition: Lemma uniquize_In {A} (ls : list A) (beq : A -> A -> bool) x : In x (uniquize beq ls) -> In x ls.
proof: Proof. intro H; induction ls as [|y ys IHys]; simpl in *; trivial. destruct (Equality.list_bin beq y (uniquize beq ys)) eqn:H'. { right; eauto with nocore. } { destruct H. { left; assumption. } { right; eauto with nocore. } } 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