law cg_eq

lawful-fields@0.1.1.0 · proof_cut.bend:670

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

670law cg_eq:
671  for +n: Nat
672  for +more: Bool
673  for +e: U32
674  for +len: U32
675  for +t: P.Tree<U32>
676  for +to: U32
677  for +sep: U32
678  {K.cut.go(n, more, (C.BT(len, t), e), to, sep) == (C.BT(len, t), CG(n, more, e, len, t, to, sep)) : D.Bytes & List<&2, U32>}