def pk.lt_le
import bend-osdev-pkcs7@0.1.0.0/PROOF.bend as PROOFimport Base
115def pk.lt_le(+x: Nat, +y: Nat) -> {Nat.is_lt(x, 1n+y) == True{} : Bool} -> {Nat.is_le(x, y) == True{} : Bool}:
116 match x:
117 case 0n:
118 h => pk.le0(y)
119 case 1n+xp:
120 match y:
121 case 0n:
122 h => pk.absurd({Nat.is_le(1n+xp, 0n) == True{} : Bool}, pk.lt0(xp)(h))
123 case 1n+yp:
124 h => pk.lt_le(xp, yp)(h)