proposition: Lemma floor_small x: 0 <= x < 1 -> floorq x = 0.
proof: Proof. by symmetry; apply:floorp2;rewrite add0r. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)