law fview_lt

lawful-bytes@0.1.1.0 · proof_fast_find.bend:926

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/fast.bend as FA
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

926# from < to: the loop runs 1 + k0 words, from word from >> 2 to word (to - 1) >> 2.
927law fview_lt:
928  for +len: U32
929  for +t: P.Tree<U32>
930  for +d: Nat
931  for +from: U32
932  for +to: U32
933  for +c: U32
934  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
935  for +ht: {Nat.is_le(U32.to_nat(to), U32.to_nat(len)) == True{} : Bool}
936  for +hc: {U32.is_lt(c, 256) == True{} : Bool}
937  for +hlt: {Nat.is_lt(U32.to_nat(from), U32.to_nat(to)) == True{} : Bool}
938  {U32.to_nat(U32.min(FG(U32.to_nat(((((to - 1 : U32) >> 2n : U32) - (from >> 2n : U32) : U32) + 1 : U32)), U32.is_zero(M0(t, from, FA.rep(c))), (from >> 2n : U32), M0(t, from, FA.rep(c)), FA.rep(c), t), to)) == D.first(D.view(C.BT(len, t)), U32.to_nat(from), U32.to_nat(to), c) : Nat}