proposition: Lemma necset_fmap'_convex ma : is_convex_set (necset_fmap' ma).
proof: Proof. apply/asboolP=> x y p [] dx madx <-{x} [] dy mady <-{y}. exists (dx <| p |> dy); last by rewrite affine_conv. by move/asboolP: (convex_setP ma); apply. 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