law fast_append_pair_t

lawful-bytes@0.1.1.0 · proof_fast_append.bend:1404

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/fast.bend as FA
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

1404law fast_append_pair_t:
1405  for +ld: U32
1406  for +td: P.Tree<U32>
1407  for +ls: U32
1408  for +ts: P.Tree<U32>
1409  for +s: U32
1410  for +n: U32
1411  {FA.append(C.BT(ld, td), C.BT(ls, ts), s, n) == (Pair.fst(D.Bytes, D.Bytes, FA.append(C.BT(ld, td), C.BT(ls, ts), s, n)), C.BT(ls, ts)) : D.Bytes & D.Bytes}