UnsignedDivision.quotient: def of bend-collections-laws-math@1.0.0.0
Import: import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/spec/unsigned_division.bend as UnsignedDivision
Lines 4-8 of bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/spec/unsigned_division.bend: https://jend.leeeet.dev/read.txt?path=bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/spec/unsigned_division.bend&start_line=4&end_line=8

import Base
import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/spec/numeric.bend as N

# Mathematical division of the interpreted input. Matching the word before
# interpreting it avoids eager unary expansion of fixed denominator constants;
# this is not a binary-division algorithm or an implementation import.
def quotient(n: Nat, word: Word(n), d: U32) -> Word(n):
  N.unsigned_quotient(n, word, d)

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Word
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/spec/numeric.bend&name=unsigned_quotient