law fa_eq

lawful-bytes@0.1.1.0 · proof_fast_append.bend:1216

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/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

1216# With BT(l1, t1) the result of the first bytes, fast append is these mirrors.
1217law fa_eq:
1218  for +ld: U32
1219  for +td: P.Tree<U32>
1220  for +ls: U32
1221  for +ts: P.Tree<U32>
1222  for +s: U32
1223  for +n: U32
1224  for +l1: U32
1225  for +t1: P.Tree<U32>
1226  for +e1: {C.BT(l1, t1) == Pair.fst(D.Bytes, D.Bytes, B.append(C.BT(ld, td), C.BT(ls, ts), s, HH(ld, n))) : D.Bytes}
1227  {FA.append(C.BT(ld, td), C.BT(ls, ts), s, n) == (C.BT(U32.add(l1, NPw(ld, n)), TF(ld, ts, s, n, l1, t1)), C.BT(ls, ts)) : D.Bytes & D.Bytes}