def smaller_high

bend-collections-laws-math@1.0.0.0 · proofs/lib/lemmas/proofs/division_candidate_bound.bend:14

import Base
import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/src/wide.bend as W
import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/proofs/division_no_overflow.bend as Overflow

14def smaller_high(r: U32, d: U32, high: {W.last(32n, Overflow.bits(d)) == False{} : Bool}, less: {U32.is_lt(r, d) == True{} : Bool}) -> {W.last(32n, Overflow.bits(r)) == False{} : Bool}:
15  match r d:
16    case U32{+a} U32{+b}:
17      Overflow.high_monotone(31n, a, b, high, lt_le(Word.cmp(32n, a, b), less))