proposition: Lemma denq_mulr_sign (b : bool) x : denq ((-1) ^+ b * x) = denq x.
proof: Proof. by case: b; rewrite ?(mul1r, mulN1r) // denqN. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype bigop order ssralg countalg div ssrnum) mathcomp(ssrint prime archimedean)