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