PROOF.bitw.fls_le.h: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/PROOF.bend as PROOF
Lines 374-383 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=374&end_line=383

import Base
import bend-osdev-algo@0.1.0.0/algo.bend as A

def bitw.fls_le.h(m: Nat, b: Bool, +p: Nat, ih: {Nat.is_le(m, p) == True{} : Bool}) -> {Nat.is_le(A.bitw.fls.step(m, b), 1n+p) == True{} : Bool}:
  match m:
    case 0n:
      match b:
        case True{}:
          nat.le_zero(p)
        case False{}:
          {==}
    case 1n+k:
      ih

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=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_le
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/PROOF.bend&name=nat.le_zero
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-algo@0.1.0.0/algo.bend&name=bitw.fls.step