proposition: Lemma ge1r_powR a r : 0 < a <= 1 -> 1 <= r -> a >= a `^ r.
proof: Proof. move=> /andP[a0 a1] r1. by rewrite (le_trans (ger_powR _ r1)) ?powRr1 ?a0// ltW. 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