proposition: Lemma RposE (p : pos) (x : positive) : refines Rpos p x -> p = pos_of_positive x.
proof: Proof. by rewrite refinesE. Qed.
imports: ZArith Lia mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq zmodp) mathcomp(path choice fintype tuple finset ssralg ssrnum bigop ssrint) CoqEAL(hrel param refinements pos)