law cap_ok_t

lawful-bytes@0.1.1.0 · proof_ops.bend:56

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

56law cap_ok_t:
57  for +len: U32
58  for +t: P.Tree<U32>
59  for +d: Nat
60  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
61  {D.cap(C.BT(len, t)) == Nat.mul(4n, Nat.pow(2n, d)) : Nat}