law ag_size

lawful-bytes@0.1.1.0 · proof_fast_append.bend:985

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

985# The length after the reference append's pushes.
986law ag_size:
987  for +n: Nat
988  for +ld: U32
989  for +td: P.Tree<U32>
990  for +ls: U32
991  for +ts: P.Tree<U32>
992  for +d: Nat
993  for +s: U32
994  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
995  for +hc: {Nat.is_le(Nat.add(U32.to_nat(ld), n), D.cap(C.BT(ld, td))) == True{} : Bool}
996  {D.size(Pair.fst(D.Bytes, D.Bytes, B.append.go(n, C.BT(ld, td), B.at(C.BT(ls, ts), s), s))) == Nat.add(U32.to_nat(ld), n) : Nat}