proposition: Lemma mulBDr n : right_distributive (@mulB n) (@addB n).
proof: Proof. move => p q r. destruct n; first apply trivialBits. apply toZp_inj. autorewrite with ZpHom. by rewrite GRing.mulrDr. Qed.
imports: HB(structures) mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq fintype tuple zmodp div) ssrextra.tuple ssrextra.nat spec spec.properties operations mathcomp(ssralg)