law to_nat_inc_lt.m
import lawful-words@0.1.0.0/proof_u32.bend as ProofU32import Base
502law to_nat_inc_lt.m:
503 for +a: U32
504 for +b: U32
505 for +h: {U32.is_lt(a, b) == True{} : Bool}
506 for +m: Nat
507 for +hm: {Nat.pow(2n, 32n) == m : Nat}
508 {U32.to_nat(U32.inc(a)) == Nat.add(U32.to_nat(a), 1n) : Nat}