proposition: Lemma ceilK : {in int_num, cancel ceil intr}.
proof: Proof. by move=> z; rewrite intrEceil => /eqP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype bigop order ssralg poly ssrnum ssrint)