proposition: Lemma ler_iXn2l x : 0 < x -> x < 1 -> {mono GRing.exp x : m n / (n <= m)%N >-> m <= n}.
proof: Proof. move=> xgt0 xlt1; apply: (le_nmono (inj_nhomo_lt _ _)); last first. by apply/ler_wiXn2l; exact/ltW. by apply: ieexprIn; rewrite ?lt_eqF ?ltr_cpable. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)