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