proposition: Lemma word_ring_morph_Z: forall (sz: nat), ring_morph (ZToWord sz 0) (ZToWord sz 1) (@wplus sz) (@wmult sz) (@wminus sz) (@wneg sz) eq 0%Z 1%Z Z.add Z.mul Z.sub Z.opp Z.eqb (ZToWord sz).
proof: Proof. constructor. + reflexivity. + reflexivity. + exact (@ZToWord_plus sz). + exact (@ZToWord_minus sz). + exact (@ZToWord_mult sz). + exact (@ZToWord_opp_wneg sz). + exact (@Zeqb_true_ZToWord sz). 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