proposition: Lemma wmod_divides_other_direction_does_not_hold: ~ forall sz (a b: word sz), b <> $0 -> (exists k, a = b ^* k) -> a ^% b = $0.
proof: Proof. intro C. specialize (C 4 $14 $5). match type of C with (?A -> _) => assert A by (intro; discriminate) end. specialize (C H). match type of C with (?A -> _) => assert A as B end. - exists (natToWord 4 6). reflexivity. - specialize (C B). cbv in C. 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