def wb

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/word.bend:51

import Base
import bend-collections-laws-crypto@1.0.0.0/proofs/lib/u32.bend as U

51# every n-bit word is below 2^n
52def wb(+n: Nat, +one: Nat, +h1: {one == 1n : Nat}, +w: Word(n)) -> {Nat.is_lt(uw(n, w), sc(n, one)) == True{} : Bool}:
53  lt1r(n, one, h1, uw(n, w), U.WB_unsigned(n, w))