proposition: Lemma powR0 x : x != 0 -> 0 `^ x = 0.
proof: Proof. by move=> x0; rewrite /powR eqxx (negbTE x0). 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