law to_nat_lt.m
import lawful-words@0.1.0.0/proof_u32.bend as ProofU32import Base
115law to_nat_lt.m:
116 for +a: U32
117 for +m: Nat
118 for +hm: {Nat.pow(2n, 32n) == m : Nat}
119 {Nat.is_lt(U32.to_nat(a), m) == True{} : Bool}
import lawful-words@0.1.0.0/proof_u32.bend as ProofU32import Base
115law to_nat_lt.m:
116 for +a: U32
117 for +m: Nat
118 for +hm: {Nat.pow(2n, 32n) == m : Nat}
119 {Nat.is_lt(U32.to_nat(a), m) == True{} : Bool}