law grow_eq

lawful-bytes@0.1.1.0 · proof_grow.bend:269

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

269law grow_eq:
270  for +len: U32
271  for +t: P.Tree<U32>
272  for +d: Nat
273  for +e: Nat
274  for +hf: {A.full(U32, P.fromT(U32, t), d) == True{} : Bool}
275  {B.grow(C.BT(len, t), e) == C.BT(len, gtree(U32.to_nat(U32.shln(1, d)), t, tnew(e, 0), 0)) : D.Bytes}