law fnone0

lawful-bytes@0.1.1.0 · proof_fast_find.bend:597

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-arrays@0.1.0.0/proof_tree.bend as P

597# The last word, unflagged: the answer is to.
598law fnone0:
599  for +len: U32
600  for +t: P.Tree<U32>
601  for +d: Nat
602  for +to: U32
603  for +c: U32
604  for +wi: U32
605  for +o: Nat
606  for +v: U32
607  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
608  for +ht: {Nat.is_le(U32.to_nat(to), U32.to_nat(len)) == True{} : Bool}
609  for +ho: {Nat.is_lt(o, 4n) == True{} : Bool}
610  for +hs: {Nat.is_le(SS(wi, o), U32.to_nat(to)) == True{} : Bool}
611  for +hk: {Nat.is_lt(U32.to_nat(wi), Nat.pow(2n, d)) == True{} : Bool}
612  for +hv: {FW.P0(v) == Nat.add(o, D.run_len(AW(t, wi, o), c)) : Nat}
613  for +hz: {U32.is_zero(FA.zb(v)) == True{} : Bool}
614  for +he: {Nat.is_le(U32.to_nat(to), Nat.mul(Nat.add(U32.to_nat(wi), 1n), 4n)) == True{} : Bool}
615  {U32.to_nat(U32.min(4294967295, to)) == D.first(UB(t), SS(wi, o), U32.to_nat(to), c) : Nat}