proposition: Lemma necset_fmap'_neq0 ma : (necset_fmap' ma) != set0.
proof: Proof. case/set0P : (neset_neq0 ma) => x max; apply/set0P. by exists (fsdistmap (f : choice_of_Type a -> choice_of_Type b) x), x. Qed.
imports: HB(structures) Reals mathcomp(all_ssreflect ssralg ssrnum) mathcomp(mathcomp_extra boolp classical_sets Rstruct reals) mathcomp(finmap) Reals_ext realType_ext classical_sets_ext ssrR fdist fsdist convex