law nvt2

lawful-fields@0.1.1.0 · proof_num.bend:589

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

589law nvt2:
590  for +n: Nat
591  for +len: U32
592  for +t: P.Tree<U32>
593  for +d: Nat
594  for +from: U32
595  for +to: U32
596  for +M: Nat
597  for +q: Nat
598  for +hm: {Nat.pow(2n, 32n) == M : Nat}
599  for +hcq: {U32.to_nat(429496729) == q : Nat}
600  for +hq: {Nat.add(Nat.mul(q, 10n), 6n) == M : Nat}
601  for +h: {D.ok(K.BT(len, t), d) == True{} : Bool}
602  for +hft: {U32.is_le(from, to) == True{} : Bool}
603  for +ht: {Nat.is_le(U32.to_nat(to), D.size(K.BT(len, t))) == True{} : Bool}
604  for +hn: {Nat.sub(U32.to_nat(to), U32.to_nat(from)) == n : Nat}
605  {F.nat_of(Pair.snd(D.Bytes, Maybe<&2, U32>, C.num(K.BT(len, t), from, to))) == F.decb(D.slice(D.view(K.BT(len, t)), U32.to_nat(from), Nat.sub(U32.to_nat(to), U32.to_nat(from))), M) : Maybe<&2, Nat>}