law fi2

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:496

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-bytes@0.1.1.0/proof_fast_word.bend as FW
import lawful-bytes@0.1.1.0/proof_fast_find.bend as FF
import lawful-arrays@0.1.0.0/proof_tree.bend as P

496law fi2:
497  for +k: Nat
498  for +z: Bool
499  for +len: U32
500  for +t: P.Tree<U32>
501  for +d: Nat
502  for +to: U32
503  for +c1: U32
504  for +c2: U32
505  for +wi: U32
506  for +o: Nat
507  for +v1: U32
508  for +v2: U32
509  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
510  for +ht: {Nat.is_le(U32.to_nat(to), U32.to_nat(len)) == True{} : Bool}
511  for +hc1: {U32.is_lt(c1, 256) == True{} : Bool}
512  for +hc2: {U32.is_lt(c2, 256) == True{} : Bool}
513  for +ho: {Nat.is_lt(o, 4n) == True{} : Bool}
514  for +hs: {Nat.is_le(FF.SS(wi, o), U32.to_nat(to)) == True{} : Bool}
515  for +he1: {Nat.is_le(U32.to_nat(to), Nat.mul(Nat.add(U32.to_nat(wi), 1n+k), 4n)) == True{} : Bool}
516  for +he2: {Nat.is_lt(Nat.mul(Nat.add(U32.to_nat(wi), k), 4n), U32.to_nat(to)) == True{} : Bool}
517  for +hv: {Nat.min(FW.P0(v1), FW.P0(v2)) == Nat.add(o, D.run_len2(FF.AW(t, wi, o), c1, c2)) : Nat}
518  for +hz: {U32.is_zero(U32.or(FA.zb(v1), FA.zb(v2))) == z : Bool}
519  {U32.to_nat(U32.min(FG2(1n+k, z, wi, U32.or(FA.zb(v1), FA.zb(v2)), FA.rep(c1), FA.rep(c2), t), to)) == D.first2(FF.UB(t), FF.SS(wi, o), U32.to_nat(to), c1, c2) : Nat}