proposition: Lemma floor_ge_int x (z : int) : (z%:~R <= x) = (z <= floor x).
proof: Proof. by rewrite Rfloor_ge_int RfloorE ler_int. Qed.
imports: HB(structures) mathcomp(all_ssreflect all_algebra) mathcomp(mathcomp_extra boolp classical_sets set_interval) Setoid