ProofFind.le_ft: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_find.bend as ProofFind
Lines 322-327 of lawful-bytes@0.1.1.0/proof_find.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_find.bend&start_line=322&end_line=327

import Base

# from <= to as numbers.
law le_ft:
  for +from: U32
  for +to: U32
  for +hft: {U32.is_le(from, to) == True{} : Bool}
  {Nat.is_le(U32.to_nat(from), U32.to_nat(to)) == True{} : Bool}

Uses (8):
  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=Equal.trans
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_le
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_le
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.to_nat
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_u32.bend&name=is_le_to_nat