law read_inc

lawful-bytes@0.1.1.0 · proof_append.bend:220

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

220law read_inc:
221  for +ls: U32
222  for +ts: P.Tree<U32>
223  for +e: Nat
224  for +s: U32
225  for +k: Nat
226  for +he: {D.ok(C.BT(ls, ts), e) == True{} : Bool}
227  for +hs: {Nat.is_le(Nat.add(U32.to_nat(s), 1n+k), U32.to_nat(ls)) == True{} : Bool}
228  {U32.to_nat((s + 1 : U32)) == Nat.add(U32.to_nat(s), 1n) : Nat}