law fview2_lt

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:561

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

561law fview2_lt:
562  for +len: U32
563  for +t: P.Tree<U32>
564  for +d: Nat
565  for +from: U32
566  for +to: U32
567  for +c1: U32
568  for +c2: U32
569  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
570  for +ht: {Nat.is_le(U32.to_nat(to), U32.to_nat(len)) == True{} : Bool}
571  for +hc1: {U32.is_lt(c1, 256) == True{} : Bool}
572  for +hc2: {U32.is_lt(c2, 256) == True{} : Bool}
573  for +hlt: {Nat.is_lt(U32.to_nat(from), U32.to_nat(to)) == True{} : Bool}
574  {U32.to_nat(U32.min(FG2(U32.to_nat(((((to - 1 : U32) >> 2n : U32) - (from >> 2n : U32) : U32) + 1 : U32)), U32.is_zero(M02(t, from, FA.rep(c1), FA.rep(c2))), (from >> 2n : U32), M02(t, from, FA.rep(c1), FA.rep(c2)), FA.rep(c1), FA.rep(c2), t), to)) == D.first2(D.view(C.BT(len, t)), U32.to_nat(from), U32.to_nat(to), c1, c2) : Nat}