law qlt2

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/poly1305/final.bend:281

import Base
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/poly1305/step.bend as ST

281law qlt2:
282  for +one: Nat
283  for +h1: {one == 1n : Nat}
284  for +h: List<&2, U32>
285  for +hh: {ST.inv(h) == True{} : Bool}
286  {Nat.is_lt(qq(h), 2n) == True{} : Bool}