def lt_succ_iroot

bend-collections-laws-crypto@1.0.0.0 · proofs/math/natural/roots.bend:257

import Base
import bend-collections-laws-crypto@1.0.0.0/src/math/natural.bend as M

257def lt_succ_iroot(+n: Nat, +kp: Nat) -> {Nat.is_lt(n, Nat.pow(1n+M.iroot_k(n, 1n+kp), 1n+kp)) == True{} : Bool}:
258  ok_lt(n, 1n+kp, M.iroot_k(n, 1n+kp), iroot_k_ok(n, kp))