law append_go_ok

lawful-bytes@0.1.1.0 · proof_append.bend:283

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

283law append_go_ok:
284  for +n: Nat
285  for +ld: U32
286  for +td: P.Tree<U32>
287  for +ls: U32
288  for +ts: P.Tree<U32>
289  for +d: Nat
290  for +s: U32
291  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
292  for +hc: {Nat.is_le(Nat.add(U32.to_nat(ld), n), D.cap(C.BT(ld, td))) == True{} : Bool}
293  {D.ok(Pair.fst(D.Bytes, D.Bytes, B.append.go(n, C.BT(ld, td), B.at(C.BT(ls, ts), s), s)), d) == True{} : Bool}