law ok_len

lawful-bytes@0.1.1.0 · proof_core.bend:260

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

260law ok_len:
261  for +len: U32
262  for +t: P.Tree<U32>
263  for +d: Nat
264  for +h: {D.ok(BT(len, t), d) == True{} : Bool}
265  {Nat.is_le(U32.to_nat(len), Nat.mul(4n, Nat.pow(2n, d))) == True{} : Bool}