proposition: Lemma real_ler_normlW x y : x \is real -> `|x| <= y -> x <= y.
proof: Proof. by move=> ?; case/real_ler_normlP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)