proposition: Lemma uniquize_shorter {A} (ls : list A) beq : List.length (uniquize beq ls) <= List.length ls.
proof: Proof. induction ls as [|x xs IHxs]; simpl; trivial. edestruct @Equality.list_bin; simpl; omega. 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