law put_dec_ok_t

lawful-fields@0.1.1.0 · proof_digits.bend:782

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

782law put_dec_ok_t:
783  for +len: U32
784  for +t: P.Tree<U32>
785  for +d: Nat
786  for +n: U32
787  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
788  for +hc: {Nat.is_le(Nat.add(D.size(C.BT(len, t)), 10n), D.cap(C.BT(len, t))) == True{} : Bool}
789  {D.ok(FC.put_dec(C.BT(len, t), n), d) == True{} : Bool}