law cut_bounds_t

lawful-fields@0.1.1.0 · proof_cut.bend:972

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-fields@0.1.1.0/defs.bend as F
import lawful-fields@0.1.1.0/fields.bend as K
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

972law cut_bounds_t:
973  for +len: U32
974  for +t: P.Tree<U32>
975  for +d: Nat
976  for +from: U32
977  for +to: U32
978  for +sep: U32
979  for +n: Nat
980  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
981  for +hft: {U32.is_le(from, to) == True{} : Bool}
982  for +ht: {Nat.is_le(U32.to_nat(to), D.size(C.BT(len, t))) == True{} : Bool}
983  for +hs: {U32.is_lt(sep, 256) == True{} : Bool}
984  {F.within(Pair.snd(D.Bytes, List<&2, U32>, K.cut(C.BT(len, t), from, to, sep, n)), U32.to_nat(from), U32.to_nat(to)) == True{} : Bool}