law ok_d

lawful-bytes@0.1.1.0 · proof_core.bend:248

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

248law ok_d:
249  for +len: U32
250  for +t: P.Tree<U32>
251  for +d: Nat
252  for +h: {D.ok(BT(len, t), d) == True{} : Bool}
253  {Nat.is_le(d, 29n) == True{} : Bool}