proposition: Lemma uwordToZ_ZToWord: forall (sz : nat) (z : Z), (0 <= z < 2 ^ (Z.of_nat sz))%Z -> uwordToZ (ZToWord sz z) = z.
proof: Proof. intros. apply uwordToZ_ZToWord_0. intuition idtac. change 2%Z with (Z.of_nat 2) in H1. rewrite <- Nat2Z.inj_pow in H1. rewrite <- N_nat_Z. rewrite Npow2_nat. 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