proposition: Lemma conv_set_neq0 p (X Y : neset A) : X :<| p |>: Y != set0.
proof: Proof. by rewrite neset_neq0. 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