def ModInverse.reduced
import bend-collections-laws-crypto@1.0.0.0/spec/math/natural.bend as Naturalimport Base
import bend-collections-laws-crypto@1.0.0.0/src/math/natural.bend as M
262def ModInverse.reduced(+a: Nat, +mp: Nat, +x: Nat, +h: {M.mod_inverse(a, 1n+mp) == Done{x} : Result<&2, &2, M.MathError, Nat>}) -> Type:
263 {Nat.is_lt(x, 1n+mp) == True{} : Bool}