def cut_pair.go

lawful-fields@0.1.1.0 · PROOF.bend:59

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-fields@0.1.1.0/fields.bend as C
import lawful-bytes@0.1.1.0/proof_core.bend as BC
import lawful-fields@0.1.1.0/proof_cut.bend as Z

59def cut_pair.go(-b: D.Bytes, +from: U32, +to: U32, +sep: U32, +n: Nat, m_b: BC.BMirror(b)) ->
60  {C.cut(b, from, to, sep, n) == (b, Pair.snd(D.Bytes, List<&2, U32>, C.cut(b, from, to, sep, n))) : D.Bytes & List<&2, U32>}:
61  (+l_b, m2_b) = m_b
62  (+t_b, +e_b) = m2_b
63  %e_b : {C.cut(_, from, to, sep, n) == (_, Pair.snd(D.Bytes, List<&2, U32>, C.cut(_, from, to, sep, n))) : D.Bytes & List<&2, U32>}
64  Z.cut_pair_t(l_b, t_b, from, to, sep, n)