LAWS.next_clear_at_least: law of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/LAWS.bend as LAWS
Lines 206-211 of bend-osdev-algo@0.1.0.0/LAWS.bend: https://jend.leeeet.dev/read.txt?path=bend-osdev-algo@0.1.0.0/LAWS.bend&start_line=206&end_line=211

import Base
import bend-osdev-algo@0.1.0.0/bitmap.bend as M

law next_clear_at_least:
  for words: List<&2, U32>
  for size: Nat
  for start: Nat
  for l: {Nat.is_lt(M.bitmap.next_clear(words, size, start), size) == True{} : Bool}
  {Nat.is_le(start, M.bitmap.next_clear(words, size, start)) == True{} : Bool}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  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_le
  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=U32
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/PROOF.bend&name=bitseq.next_ge
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/bitmap.bend&name=bitmap.bits
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/bitmap.bend&name=bitmap.next_clear