def iroot_le
import bend-collections-laws-crypto@1.0.0.0/proofs/math/natural/roots.bend as Rootsimport Base
import bend-collections-laws-crypto@1.0.0.0/src/math/natural.bend as M
254def iroot_le(+n: Nat, +kp: Nat) -> {Nat.is_le(Nat.pow(M.iroot_k(n, 1n+kp), 1n+kp), n) == True{} : Bool}:
255 ok_le(n, 1n+kp, M.iroot_k(n, 1n+kp), iroot_k_ok(n, kp))