law to_nat_add.m

lawful-words@0.1.0.0 · proof_u32.bend:368

import Base

368law to_nat_add.m:
369  for +a: U32
370  for +b: U32
371  for +m: Nat
372  for +hm: {Nat.pow(2n, 32n) == m : Nat}
373  {U32.to_nat(U32.add(a, b)) == Nat.mod(Nat.add(U32.to_nat(a), U32.to_nat(b)), m) : Nat}