def uq.le_bits
import bend-osdev-algo@0.1.0.0/proof_u32.bend as ProofU32import Base
286def uq.le_bits(+y: Nat, +x: Nat, +a: Bool, +b: Bool, h: {Nat.is_le(uq.bv(a, y), uq.bv(b, x)) == True{} : Bool}) -> {Cmp.is_le(Word.cmp.fin(a, b, Nat.cmp(y, x))) == True{} : Bool}:
287 %uq.nc(y, x, a, b) : {Cmp.is_le(_) == True{} : Bool}
288 h