proposition: Lemma wlt_lt_bound: forall sz (a : word sz) (b bound : nat), (a < natToWord sz b)%word -> (b <= wordToNat (natToWord sz bound))%nat -> (wordToNat a < b)%nat.
proof: Proof. intros. apply wlt_lt in H. erewrite wordToNat_natToWord_bound in H; eauto. 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