law cut_pair_t
lawful-fields@0.1.1.0 · proof_cut.bend:713
import lawful-fields@0.1.1.0/proof_cut.bend as ProofCut
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
713law cut_pair_t:
714 for +len: U32
715 for +t: P.Tree<U32>
716 for +from: U32
717 for +to: U32
718 for +sep: U32
719 for +n: Nat
720 {K.cut(C.BT(len, t), from, to, sep, n) == (C.BT(len, t), Pair.snd(D.Bytes, List<&2, U32>, K.cut(C.BT(len, t), from, to, sep, n))) : D.Bytes & List<&2, U32>}