ProofNum.lift: law of lawful-fields@0.1.1.0
Import: import lawful-fields@0.1.1.0/proof_num.bend as ProofNum
Lines 23-29 of lawful-fields@0.1.1.0/proof_num.bend: https://jend.leeeet.dev/read.txt?path=lawful-fields@0.1.1.0/proof_num.bend&start_line=23&end_line=29

import Base

# A bound below M gives the bound below 2^32 that lawful-words' lemmas want.
law lift:
  for +x: Nat
  for +M: Nat
  for +hm: {Nat.pow(2n, 32n) == M : Nat}
  for +h: {Nat.is_lt(x, M) == True{} : Bool}
  {Nat.is_lt(x, Nat.pow(2n, 32n)) == True{} : Bool}

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_lt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.pow