law to_nat_sub.m

lawful-words@0.1.0.0 · proof_u32.bend:390

import Base

390law to_nat_sub.m:
391  for +a: U32
392  for +b: U32
393  for +m: Nat
394  for +hm: {Nat.pow(2n, 32n) == m : Nat}
395  {U32.to_nat(U32.sub(a, b)) == Nat.mod(Nat.sub(Nat.add(U32.to_nat(a), m), U32.to_nat(b)), m) : Nat}