proposition: Lemma mul_div_exact: forall (a b: nat), b <> 0 -> a mod b = 0 -> b * (a / b) = a.
proof: Proof. intros. edestruct Nat.div_exact as [_ P]; [eassumption|]. specialize (P H0). symmetry. exact P. Qed.
imports: Coq.Classes.Morphisms Coq.Classes.Morphisms_Prop Coq.Bool.Bool Coq.Arith.Arith Coq.micromega.Lia Coq.NArith.NArith Coq.ZArith.ZArith bbv.N_Z_nat_conversions bbv.Nomega