law step_room

lawful-bytes@0.1.1.0 · proof_append.bend:147

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

147law step_room:
148  for +ld: U32
149  for +td: P.Tree<U32>
150  for +d: Nat
151  for +k: Nat
152  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
153  for +hc: {Nat.is_le(Nat.add(U32.to_nat(ld), 1n+k), D.cap(C.BT(ld, td))) == True{} : Bool}
154  {Nat.is_lt(U32.to_nat(ld), Nat.mul(4n, Nat.pow(2n, d))) == True{} : Bool}