def bq.pw_pos
import bend-osdev-algo@0.1.0.0/proof_bsearch.bend as ProofBsearchimport Base
import bend-osdev-algo@0.1.0.0/proof_u32.bend as U
264def bq.pw_pos(f: Nat) -> {Nat.is_lt(0n, U.uq.pw(f)) == True{} : Bool}:
265 match f:
266 case 0n:
267 {==}
268 case 1n+ +g:
269 U.uq.lt_dbl_self(0n, U.uq.pw(g), bq.pw_pos(g))