proposition: Lemma add0B n : left_id #0 (@addB n).
proof: Proof. move => x. destruct n; first apply trivialBits. apply toZp_inj. autorewrite with ZpHom. by rewrite add0r. 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)