proposition: Lemma lty_poweRy x r : r != 0%R -> x `^ r < +oo -> x < +oo.
proof: Proof. by move=> r0; move: x => [x| | _]//=; rewrite ?ltry// (negbTE r0). 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