law find2_view_t

lawful-bytes@0.1.1.0 · proof_find.bend:422

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

422law find2_view_t:
423  for +len: U32
424  for +t: P.Tree<U32>
425  for +d: Nat
426  for +from: U32
427  for +to: U32
428  for +c1: U32
429  for +c2: U32
430  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
431  for +hft: {U32.is_le(from, to) == True{} : Bool}
432  for +ht: {Nat.is_le(U32.to_nat(to), D.size(C.BT(len, t))) == True{} : Bool}
433  for +hc1: {U32.is_lt(c1, 256) == True{} : Bool}
434  for +hc2: {U32.is_lt(c2, 256) == True{} : Bool}
435  {U32.to_nat(Pair.snd(D.Bytes, U32, B.find2(C.BT(len, t), from, to, c1, c2))) == D.first2(D.view(C.BT(len, t)), U32.to_nat(from), U32.to_nat(to), c1, c2) : Nat}