law to_nat_inc.m

lawful-words@0.1.0.0 · proof_u32.bend:153

import Base

153law to_nat_inc.m:
154  for +a: U32
155  for +m: Nat
156  for +hm: {Nat.pow(2n, 32n) == m : Nat}
157  {U32.to_nat(U32.inc(a)) == Nat.mod(Nat.add(U32.to_nat(a), 1n), m) : Nat}