PROOF.bs.le_len.h: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/PROOF.bend as PROOF
Lines 1083-1088 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=1083&end_line=1088

import Base
import bend-osdev-algo@0.1.0.0/bsearch.bend as S

def bs.le_len.h(c: Bool, r: Nat, +n: Nat, ih: {Nat.is_le(r, n) == True{} : Bool}) -> {Nat.is_le(S.bsearch.below.step(c, r), 1n+n) == True{} : Bool}:
  match c:
    case True{}:
      ih
    case False{}:
      {==}

Uses (4):
  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/bsearch.bend&name=bsearch.below.step