def mod_mod
import bend-collections-laws-crypto@1.0.0.0/proofs/math/natural/arith.bend as Arithimport Base
131# (x mod n) mod n == x mod n (Mathlib Nat.mod_mod)
132def mod_mod(+bp: Nat, +x: Nat) -> {Nat.mod(Nat.mod(x, 1n+bp), 1n+bp) == Nat.mod(x, 1n+bp) : Nat}:
133 mod_of(0n, bp, Nat.mod(x, 1n+bp), dm_lt(bp, x))
Uses (4)
Used by (6)
- bend-collections-laws-crypto@1.0.0.0/proofs/crypto/curve25519/cong:c_mod
- bend-collections-laws-crypto@1.0.0.0/proofs/crypto/ed25519/pcodec:red
- bend-collections-laws-crypto@1.0.0.0/proofs/crypto/poly1305/poly:horner_mod
- bend-collections-laws-crypto@1.0.0.0/proofs/math/natural/inverse:inv_bezout
- bend-collections-laws-crypto@1.0.0.0/proofs/crypto/curve25519/proof:inv_value
- …