law step_lt4

lawful-bytes@0.1.1.0 · proof_find.bend:217

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

217law step_lt4:
218  for +len: U32
219  for +t: P.Tree<U32>
220  for +d: Nat
221  for +j: U32
222  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
223  for +hj: {Nat.is_lt(U32.to_nat(j), U32.to_nat(len)) == True{} : Bool}
224  {Nat.is_lt(U32.to_nat(j), Nat.mul(4n, Nat.pow(2n, d))) == True{} : Bool}