proposition: Lemma Rfloor_ge_int x (n : int) : (n%:~R <= x)= (n%:~R <= Rfloor x).
proof: Proof. apply/idP/idP; last by move/le_trans => /(_ _ (Rfloor_le x)). by move/le_Rfloor; apply le_trans; rewrite Rfloor_natz. Qed.
imports: HB(structures) mathcomp(all_ssreflect all_algebra) mathcomp(mathcomp_extra boolp classical_sets set_interval) Setoid