law ok1

lawful-bytes@0.1.1.0 · proof_fast_append.bend:1312

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

1312law ok1:
1313  for +ld: U32
1314  for +td: P.Tree<U32>
1315  for +ls: U32
1316  for +ts: P.Tree<U32>
1317  for +d: Nat
1318  for +s: U32
1319  for +n: U32
1320  for +l1: U32
1321  for +t1: P.Tree<U32>
1322  for +e1: {C.BT(l1, t1) == D1(ld, td, ls, ts, s, n) : D.Bytes}
1323  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
1324  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}
1325  {D.ok(C.BT(l1, t1), d) == True{} : Bool}