ProofCut.FV: def of lawful-fields@0.1.1.0
Import: import lawful-fields@0.1.1.0/proof_cut.bend as ProofCut
Lines 634-635 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=634&end_line=635

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/proof_tree.bend as P

def FV(+len: U32, +t: P.Tree<U32>, +s: U32, +to: U32, +sep: U32) -> U32:
  Pair.snd(D.Bytes, U32, B.find(C.BT(len, t), s, to, sep))

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair.snd
  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/bytes.bend&name=find
  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