law winc.m

lawful-words@0.1.0.0 · proof_u32.bend:29

import Base
import lawful-words@0.1.0.0/proof_nat.bend as N
import lawful-words@0.1.0.0/proof_word.bend as W

29law winc.m:
30  for +w: Word(32n)
31  for +m: Nat
32  for +hm: {Nat.pow(2n, 32n) == m : Nat}
33  {Nat.add(Word.to_nat(32n, Word.inc(32n, w)), Nat.mul(N.bn(W.incc(32n, w)), m)) == 1n+Word.to_nat(32n, w) : Nat}