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