law to_list_view_t

lawful-bytes@0.1.1.0 · proof_same.bend:381

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

381law to_list_view_t:
382  for +len: U32
383  for +t: P.Tree<U32>
384  for +d: Nat
385  for +s: U32
386  for +n: U32
387  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
388  for +hs: {Nat.is_le(Nat.add(U32.to_nat(s), U32.to_nat(n)), D.size(C.BT(len, t))) == True{} : Bool}
389  {Pair.snd(D.Bytes, List<&2, U32>, B.to_list(C.BT(len, t), s, n)) == D.slice(D.view(C.BT(len, t)), U32.to_nat(s), U32.to_nat(n)) : List<&2, U32>}