proposition: Lemma partition_1 : forall s f, @compat_bool elt E.eq f -> Equal (fst (partition f s)) (filter f s).
proof: Proof. intros. rewrite partition_filter. apply eq_refl. Qed.
imports: Bool PeanoNat BinPos OrderedType OrderedTypeEx FSetInterface