proposition: Lemma poweR_lty x r : x < +oo -> x `^ r < +oo.
proof: Proof. by move: x => [x| |]//=; rewrite ?ltry//; case: ifPn => // _; rewrite ltry. Qed.
imports: mathcomp(all_ssreflect ssralg ssrint ssrnum matrix) mathcomp(interval rat) mathcomp(boolp classical_sets functions) mathcomp(mathcomp_extra) reals ereal signed topology normedtype landau sequences derive realfun itv convex