def AP.hb
import bend-osdev-array@0.1.0.1/PROOF.bend as PROOFimport Base
233def AP.hb(+y: Nat, +x: Nat, h: {Nat.is_le(AP.bv(True{}, y), AP.bv(False{}, x)) == True{} : Bool}) -> {Nat.is_le(1n+y, x) == True{} : Bool}:
234 %Equal.sym(Bool, Nat.is_le(1n+y, x), Nat.is_lt(y, x), AP.le_succ(y, x)) : {_ == True{} : Bool}
235 %AP.fin_le_tf(Nat.cmp(y, x)) : {_ == True{} : Bool}
236 AP.le_bits(y, x, True{}, False{}, h)