proposition: Lemma convex_function_comp' (f : {convex T -> U}) (g : {convex U -> V}) (g_monotone : forall x y, x <= y -> g x <= g y) : convex_function (g \o f).
proof: Proof. by apply convex_function_comp => // *; exact: g_monotone. Qed.
imports: HB(structures) mathcomp(all_ssreflect ssralg fingroup perm matrix) mathcomp(mathcomp_extra boolp classical_sets Rstruct) mathcomp(ssrnum ereal) mathcomp(lra Rstruct reals) Reals ssrR Reals_ext Ranalysis_ext ssr_ext ssralg_ext logb realType_ext fdist