law nx_eq

lawful-fields@0.1.1.0 · proof_cut.bend:654

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

654law nx_eq:
655  for +want: Bool
656  for +len: U32
657  for +t: P.Tree<U32>
658  for +s: U32
659  for +to: U32
660  for +sep: U32
661  {K.cut.next(want, C.BT(len, t), s, to, sep) == (C.BT(len, t), NX(want, len, t, s, to, sep)) : D.Bytes & U32}