PROOF.bitw.below: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/PROOF.bend as PROOF
Lines 201-207 of bend-osdev-algo@0.1.0.0/PROOF.bend: https://jend.leeeet.dev/read.txt?path=bend-osdev-algo@0.1.0.0/PROOF.bend&start_line=201&end_line=207

import Base

# j lies below the lowest set bit (every j does when there is none)
def bitw.below(j: Nat, m: Nat) -> Bool:
  match m:
    case 0n:
      True{}
    case 1n+k:
      Nat.is_lt(j, k)

Uses (3):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  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