def uq.ha
import bend-osdev-algo@0.1.0.0/proof_u32.bend as ProofU32import Base
290def uq.ha(+y: Nat, +x: Nat, h: {Nat.is_le(uq.bv(False{}, y), uq.bv(False{}, x)) == True{} : Bool}) -> {Nat.is_le(y, x) == True{} : Bool}:
291 %uq.fin_le_ff(Nat.cmp(y, x)) : {_ == True{} : Bool}
292 uq.le_bits(y, x, False{}, False{}, h)