proposition: Lemma lt0r_neq0 (x : R) : 0 < x -> x != 0.
proof: Proof. by move=> /gt_eqF ->. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)