law read_next

lawful-bytes@0.1.1.0 · proof_append.bend:234

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

234law read_next:
235  for +ls: U32
236  for +ts: P.Tree<U32>
237  for +e: Nat
238  for +s: U32
239  for +k: Nat
240  for +he: {D.ok(C.BT(ls, ts), e) == True{} : Bool}
241  for +hs: {Nat.is_le(Nat.add(U32.to_nat(s), 1n+k), U32.to_nat(ls)) == True{} : Bool}
242  {Nat.is_le(Nat.add(U32.to_nat((s + 1 : U32)), k), U32.to_nat(ls)) == True{} : Bool}