law array_lower_bound_same

bend-osdev-algo@0.1.0.0 · LAWS.bend:290

import Base
import bend-osdev-array@0.1.0.0/array.bend as AR
import bend-osdev-algo@0.1.0.0/bsearch.bend as S

290law array_lower_bound_same:
291  for +d: Nat
292  for a: Array<U32>
293  for hp: {AR.Arrays.is_perfect(U32, d, a) == True{} : Bool}
294  for hd: {Nat.is_lt(d, 32n) == True{} : Bool}
295  for n: U32
296  for key: U32
297  {Pair.fst(Array<U32>, U32, S.bsearch.array_lower_bound(a, n, key)) == a : Array<U32>}