proposition: Lemma wmul_mod_distr_does_not_hold: ~ forall sz (a b n: word sz), n <> $0 -> (a ^* b) ^% n = ((a ^% n) ^* (b ^% n)) ^% n.
proof: Proof. intro C. specialize (C 4 $9 $11 $7). cbv in C. match type of C with (?A -> _) => assert A by (intro; discriminate) end. specialize (C H). discriminate. 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