law pd_room

lawful-fields@0.1.1.0 · proof_digits.bend:747

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

747law pd_room:
748  for +len: U32
749  for +t: P.Tree<U32>
750  for +d: Nat
751  for +n: U32
752  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
753  for +hc: {Nat.is_le(Nat.add(D.size(C.BT(len, t)), 10n), D.cap(C.BT(len, t))) == True{} : Bool}
754  {Nat.is_le(Nat.add(U32.to_nat(len), List.length(&2, U32, FC.put_dec.list(n))), Nat.mul(4n, Nat.pow(2n, d))) == True{} : Bool}