proposition: Lemma msbCons n b (p:BITS n.+1) : msb (consB b p) = msb p.
proof: Proof. case/tupleP: p => [b' p]. by rewrite /msb last_cons. 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)