def bitw.fls_zero.b

bend-osdev-algo@0.1.0.0 · PROOF.bend:349

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

349def bitw.fls_zero.b(m: Nat, b: Bool, e: {A.bitw.fls.step(m, b) == 0n : Nat}) -> {b == False{} : Bool}:
350  match m:
351    case 0n:
352      match b:
353        case True{}:
354          Empty.absurd({True{} == False{} : Bool}, absurd.sz(0n, e))
355        case False{}:
356          {==}
357    case 1n+k:
358      Empty.absurd({b == False{} : Bool}, absurd.sz(1n+k, e))