proposition: Lemma incB_fromNat n m : incB (n:=n) #m = #(m.+1).
proof: Proof. destruct n; first apply trivialBits. apply toZp_inj. autorewrite with ZpHom. by rewrite -(addn1 m) natrD. 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)