proposition: Lemma ltr_iXn2l x : 0 < x -> x < 1 -> {mono GRing.exp x : m n / (n < m)%N >-> m < n}.
proof: Proof. by move=> xgt0 xlt1; apply: (leW_nmono (ler_iXn2l _ _)). Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)