law append_pair_t

lawful-bytes@0.1.1.0 · proof_append.bend:271

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

271law append_pair_t:
272  for +ld: U32
273  for +td: P.Tree<U32>
274  for +ls: U32
275  for +ts: P.Tree<U32>
276  for +s: U32
277  for +n: U32
278  {B.append(C.BT(ld, td), C.BT(ls, ts), s, n) == (Pair.fst(D.Bytes, D.Bytes, B.append(C.BT(ld, td), C.BT(ls, ts), s, n)), C.BT(ls, ts)) : D.Bytes & D.Bytes}