law step_inc

lawful-bytes@0.1.1.0 · proof_same.bend:125

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

125law step_inc:
126  for +len: U32
127  for +t: P.Tree<U32>
128  for +d: Nat
129  for +s: U32
130  for +m: Nat
131  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
132  for +hs: {Nat.is_le(Nat.add(U32.to_nat(s), 1n+m), U32.to_nat(len)) == True{} : Bool}
133  {U32.to_nat((s + 1 : U32)) == Nat.add(U32.to_nat(s), 1n) : Nat}