law hlen0

lawful-bytes@0.1.1.0 · proof_fast_append.bend:1376

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

1376law hlen0:
1377  for +ld: U32
1378  for +td: P.Tree<U32>
1379  for +l1: U32
1380  for +d: Nat
1381  for +n: U32
1382  for +el: {U32.to_nat(l1) == Nat.add(U32.to_nat(ld), U32.to_nat(HH(ld, n))) : Nat}
1383  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
1384  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}
1385  {Nat.is_le(Nat.add(U32.to_nat(l1), U32.to_nat(NPw(ld, n))), Nat.mul(4n, Nat.pow(2n, d))) == True{} : Bool}