def go_acc

bend-collections-laws-math@1.0.0.0 · proofs/math/natural/bits.bend:43

import Base
import bend-collections-laws-math@1.0.0.0/src/math/natural.bend as M

43def go_acc(fuel: Nat, +n: Nat, +k: Nat) -> {M.bit_length_go(fuel, n, 1n+k) == 1n+M.bit_length_go(fuel, n, k) : Nat}:
44  match fuel n:
45    case 0n n0:
46      {==}
47    case 1n+f 0n:
48      {==}
49    case 1n+ +f 1n+ +np:
50      go_acc(f, Nat.div(1n+np, 2n), 1n+k)