proposition: Lemma powRr0 a : a `^ 0 = 1.
proof: Proof. by rewrite /powR; case: ifPn; rewrite ?eqxx// mul0r expR0. 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