proposition: Lemma floor_ge0 x: 0 <= x -> 0 <= floorq x.
proof: Proof. move /andP:(floorp1 x) => [la lb] lc. by move: (Order.POrderTheory.le_lt_trans lc lb); rewrite succq ltr0z ltzD1. 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)