proposition: Lemma Rpos_neq0 (x : Rpos) : val x != 0.
proof: Proof. by case: x => p /=; rewrite /RltP lt0r => /andP[]. Qed.
imports: mathcomp(all_ssreflect) mathcomp(all_algebra vector reals normedtype) mathcomp(mathcomp_extra boolp) mathcomp(Rstruct) ssrR realType_ext Reals Lra mathcomp(lra)