proposition: Lemma shlB_mul2exp n m (p:BITS n) : iter m shlB p = p *# 2^m.
proof: Proof. induction m. by rewrite expn0 mulB1. by rewrite iterS expnS IHm shlB_asMul -mulB_muln mulnC. 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)