proposition: Lemma incBneq n : forall (p: BITS n.+1), incB p != p.
proof: Proof. move => p. apply (introN eqP). apply: incBDistinct. 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)