proposition: Lemma tool : forall (a b: R), (b != 0) ==> (norm (a %% b) < norm b).
proof: Proof. move => a b. apply/implyP => h. case: (edivP a b) => q r h1 /=. by move/implyP; apply. Qed.
imports: HB(structures) Coq(ssreflect ssrfun ssrbool Arith.Wf_nat) mathcomp(eqtype ssrnat div seq path) mathcomp(ssralg fintype perm tuple choice generic_quotient) mathcomp(matrix bigop zmodp mxalgebra poly) stronglydiscrete