proposition: Lemma find_range1z x : exists m : int, range1 m x.
proof: Proof. by have [m Dm] := int_floor x; exists m; case: (range1z_floor m x); auto. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div order) mathcomp(ssralg ssrnum ssrint rat intdiv) Coq(Morphisms Setoid) fourcolor(real realsyntax)