def bitw.fls_zero.m
import bend-osdev-algo@0.1.0.0/PROOF.bend as PROOFimport Base
import bend-osdev-algo@0.1.0.0/algo.bend as A
342def bitw.fls_zero.m(m: Nat, b: Bool, e: {A.bitw.fls.step(m, b) == 0n : Nat}) -> {m == 0n : Nat}:
343 match m:
344 case 0n:
345 {==}
346 case 1n+k:
347 Empty.absurd({1n+k == 0n : Nat}, absurd.sz(1n+k, e))