proposition: Lemma ltB_bound n (p q: BITS n) : ltB p q -> toNat p < (2^n).-1.
proof: Proof. rewrite ltB_nat. have B:= toNatBounded q. move => H. eapply leq_trans. apply H. rewrite -ltnS. rewrite prednK; last apply expn_gt0. done. 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)