law step_cap

lawful-bytes@0.1.1.0 · proof_append.bend:187

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

187law step_cap:
188  for +ld: U32
189  for +td: P.Tree<U32>
190  for +d: Nat
191  for +x: U32
192  for +k: Nat
193  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
194  for +hc: {Nat.is_le(Nat.add(U32.to_nat(ld), 1n+k), D.cap(C.BT(ld, td))) == True{} : Bool}
195  {Nat.is_le(Nat.add(U32.to_nat((ld + 1 : U32)), k), D.cap(C.BT((ld + 1 : U32), PT(ld, td, x)))) == True{} : Bool}