def le_step
import bend-collections-laws-math@1.0.0.0/proofs/math/number/prime.bend as Primeimport Base
import bend-collections-laws-math@1.0.0.0/proofs/lib/nat.bend as N
46def le_step(+d: Nat, +e: Nat, +h: {Nat.is_le(d, e) == True{} : Bool}) -> {Nat.is_le(d, 1n+e) == True{} : Bool}:
47 N.le_trans(d, e, 1n+e, h, N.le_succ(e))