proposition: Lemma uwordToZ_bound: forall sz (a: word sz), (0 <= uwordToZ a < 2 ^ Z.of_nat sz)%Z.
proof: Proof. intros. unfold uwordToZ. split. + apply N2Z.is_nonneg. + pose proof (wordToN_bound a) as P. apply N2Z.inj_lt in P. rewrite Z_of_N_Npow2 in P. assumption. Qed.
imports: Coq.Classes.Morphisms Coq.Classes.Morphisms_Prop Coq.Classes.Equivalence Coq.Arith.PeanoNat Coq.ZArith.BinInt  Coq.Arith.Arith Coq.NArith.NArith Coq.Bool.Bool Coq.ZArith.ZArith Coq.Logic.Eqdep_dec Coq.Logic.EqdepFacts Coq.Program.Tactics Coq.Program.Equality Coq.setoid_ring.Ring Coq.setoid_ring.Ring_polynom bbv.Nomega bbv.ZLib bbv.NatLib bbv.NLib bbv.N_Z_nat_conversions bbv.DepEq bbv.DepEqNat bbv.ReservedNotations Coq.micromega.Lia