proposition: Lemma num_le_maxr a x y : a <= Num.max x%:num y%:num = (a <= x%:num) || (a <= y%:num).
proof: Proof. by rewrite -comparable_le_maxr// real_comparable. Qed.
imports: HB(structures) Coq(ssreflect ssrfun ssrbool) mathcomp(ssrnat eqtype choice order ssralg ssrnum ssrint) mathcomp(mathcomp_extra)