Conformance.mod_shift: law of bend-collections-laws-crypto@1.0.0.0
Import: import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/sha/conformance.bend as Conformance
Lines 631-634 of bend-collections-laws-crypto@1.0.0.0/proofs/crypto/sha/conformance.bend: https://jend.leeeet.dev/read.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/crypto/sha/conformance.bend&start_line=631&end_line=634

import Base

# Sixty-four divmod steps return to the initial counter state with a larger quotient.
law mod_shift:
  for +x: Nat
  {Nat.mod(Nat.add(64n, x), 64n) == Nat.mod(x, 64n) : Nat}

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=Nat.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.mod
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/crypto/sha/conformance.bend&name=mod_quotient