proposition: Lemma incBDistinct n : forall (p: BITS n.+1), incB p <> p.
proof: Proof. case/tupleP => b p'. by elim b. 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)