proposition: Lemma div_eq: forall a b : nat, b <> 0 -> b * NPeano.div a b = a - NPeano.modulo a b.
proof: Proof. intros; rewrite NPeano.Nat.mod_eq by assumption. rewrite sub_plus; try omega. apply NPeano.Nat.mul_div_le; auto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Bedrock.Word Coq.ZArith.ZArith Coq.Strings.Ascii Coq.Strings.String Coq.Logic.Eqdep_dec Fiat.Computation.Core Fiat.Computation.FixComp Fiat.Computation.Notations Fiat.Computation.Refinements.General Fiat.Common.DecideableEnsembles Fiat.Narcissus.Common.Specs Fiat.Narcissus.Formats.FixStringOpt Fiat.Narcissus.Formats.NatOpt Fiat.Narcissus.Formats.WordOpt Fiat.Narcissus.Formats.AsciiOpt