law fast_append_ok_t

lawful-bytes@0.1.1.0 · proof_fast_append.bend:1440

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

1440law fast_append_ok_t:
1441  for +ld: U32
1442  for +td: P.Tree<U32>
1443  for +ls: U32
1444  for +ts: P.Tree<U32>
1445  for +d: Nat
1446  for +s: U32
1447  for +n: U32
1448  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
1449  for +hc: {Nat.is_le(Nat.add(D.size(C.BT(ld, td)), U32.to_nat(n)), D.cap(C.BT(ld, td))) == True{} : Bool}
1450  {D.ok(Pair.fst(D.Bytes, D.Bytes, FA.append(C.BT(ld, td), C.BT(ls, ts), s, n)), d) == True{} : Bool}