law from_nat_to_nat.m
import lawful-words@0.1.0.0/proof_u32.bend as ProofU32import Base
199law from_nat_to_nat.m:
200 for +a: U32
201 for +m: Nat
202 for +hm: {Nat.pow(2n, 32n) == m : Nat}
203 {U32.from_nat(U32.to_nat(a)) == a : U32}
import lawful-words@0.1.0.0/proof_u32.bend as ProofU32import Base
199law from_nat_to_nat.m:
200 for +a: U32
201 for +m: Nat
202 for +hm: {Nat.pow(2n, 32n) == m : Nat}
203 {U32.from_nat(U32.to_nat(a)) == a : U32}