def divmod_eq
import bend-collections-laws-crypto@1.0.0.0/proofs/math/natural/misc.bend as Miscimport Base
import bend-collections-laws-crypto@1.0.0.0/proofs/math/natural/arith.bend as R
16def divmod_eq(+a: Nat, +bp: Nat) -> {a == Nat.add(Nat.mul(Nat.div(a, 1n+bp), 1n+bp), Nat.mod(a, 1n+bp)) : Nat}:
17 R.dm_eq(bp, a)