law append_go_pair

lawful-bytes@0.1.1.0 · proof_append.bend:252

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

252law append_go_pair:
253  for +n: Nat
254  for -dst: D.Bytes
255  for +ls: U32
256  for +ts: P.Tree<U32>
257  for +s: U32
258  {B.append.go(n, dst, B.at(C.BT(ls, ts), s), s) == (Pair.fst(D.Bytes, D.Bytes, B.append.go(n, dst, B.at(C.BT(ls, ts), s), s)), C.BT(ls, ts)) : D.Bytes & D.Bytes}