proposition: Lemma ReMr : {in real, forall x, {morph Re : z / z * x}}.
proof: Proof. by move=> x Rx z /=; rewrite mulrC ReMl // mulrC. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)