~/jendhub

def bq.sub_step

bend-osdev-algo@0.1.0.0 · proof_bsearch.bend:327

import bend-osdev-algo@0.1.0.0/proof_bsearch.bend as ProofBsearch
import Base

327def bq.sub_step(q: Nat, k: Nat) -> {Nat.is_le(Nat.sub(q, k), 1n+Nat.sub(q, 1n+k)) == True{} : Bool}:
328  match q k:
329    case 0n _:
330      {==}
331    case 1n+ +qp 0n:
332      %Equal.sym(Nat, Nat.sub(qp, 0n), qp, bq.sub_zero(qp)) : {Nat.is_le(1n+qp, 1n+_) == True{} : Bool}
333      bq.le_refl(qp)
334    case 1n+qp 1n+kp:
335      bq.sub_step(qp, kp)

Uses (7)

Used by (1)