proposition: Lemma toNatNil (p:BITS 0) : toNat p = 0.
proof: Proof. by rewrite (tuple0 p). Qed.
imports: Coq(ZArith.ZArith) mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq fintype tuple div zmodp ssralg) ssrextra.nat ssrextra.tuple spec.spec