def pk.le_step
import bend-osdev-pkcs7@0.1.0.0/PROOF.bend as PROOFimport Base
58def pk.le_step(+x: Nat, +y: Nat) -> {Nat.is_le(x, y) == True{} : Bool} -> {Nat.is_le(x, 1n+y) == True{} : Bool}:
59 match x y:
60 case 0n _:
61 h => {==}
62 case 1n+xp 0n:
63 h => pk.absurd({Nat.is_le(1n+xp, 1n) == True{} : Bool}, h)
64 case 1n+xp 1n+yp:
65 h => pk.le_step(xp, yp)(h)