ProofCut.nx_eq: law of lawful-fields@0.1.1.0
Import: import lawful-fields@0.1.1.0/proof_cut.bend as ProofCut
Lines 654-661 of lawful-fields@0.1.1.0/proof_cut.bend: https://jend.leeeet.dev/read.txt?path=lawful-fields@0.1.1.0/proof_cut.bend&start_line=654&end_line=661

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

law nx_eq:
  for +want: Bool
  for +len: U32
  for +t: P.Tree<U32>
  for +s: U32
  for +to: U32
  for +sep: U32
  {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}

Uses (10):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=Tree
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/defs.bend&name=Bytes
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_core.bend&name=BT
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_find.bend&name=find_pair_t
  https://jend.leeeet.dev/definition.txt?path=lawful-fields@0.1.1.0/fields.bend&name=cut.next
  https://jend.leeeet.dev/definition.txt?path=lawful-fields@0.1.1.0/proof_cut.bend&name=NX