def ba.lbs.body

bend-osdev-algo@0.1.0.0 · PROOF.bend:1442

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

1442def ba.lbs.body(+d: Nat, -a: Array<U32>, +hd: {Nat.is_lt(d, 32n) == True{} : Bool}, +n: U32, +key: U32, +l: List<&2, U32>, +e1: {AR.Arrays.of_list(U32, d, l, 0) == a : Array<U32>}, +hl: {List.length(&2, U32, l) == AR.Arrays.slots(d) : Nat}) -> {Pair.fst(Array<U32>, U32, S.bsearch.array_lower_bound(a, n, key)) == a : Array<U32>}:
1443  -ol = AR.Arrays.of_list(U32, d, l, 0)
1444  %e1 : {Pair.fst(Array<U32>, U32, S.bsearch.array_lower_bound(_, n, key)) == _ : Array<U32>}
1445  %Equal.sym(Array<U32> & U32, S.bsearch.array.go(33n, S.BsearchState{ol, 0, n}, key), (ol, Q.bq.run(33n, d, l, 0, n, key)), Q.bq.go(33n, d, l, hl, hd, 0, n, key)) : {Pair.fst(Array<U32>, U32, _) == ol : Array<U32>}
1446  {==}