law cut_eq
lawful-fields@0.1.1.0 · proof_cut.bend:698
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
698law cut_eq:
699 for +len: U32
700 for +t: P.Tree<U32>
701 for +from: U32
702 for +to: U32
703 for +sep: U32
704 for +n: Nat
705 {K.cut(C.BT(len, t), from, to, sep, n) == (C.BT(len, t), CG(n, True{}, NX(Bool.not(Nat.is_eq(n, 0n)), len, t, from, to, sep), len, t, to, sep)) : D.Bytes & List<&2, U32>}