proposition: Lemma RnatE (n : nat) (x : N) : refines Rnat n x -> n = 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)