def pos_zero

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/secp256k1/limbs.bend:119

import Base
import bend-collections-laws-crypto@1.0.0.0/spec/lib/common.bend as C
import bend-collections-laws-crypto@1.0.0.0/proofs/math/typed/width.bend as WW

119def pos_zero(n: Nat) -> {pos(n, 0n) == 0n : Nat}:
120  match n:
121    case 0n:
122      {==}
123    case 1n+ +k:
124      %Equal.sym(Nat, pos(k, 0n), 0n, pos_zero(k)) : {C.shift(16n, _) == 0n : Nat}
125      %Equal.sym(Nat, C.shift(16n, 0n), 0n, WW.shift_zero(16n)) : {_ == 0n : Nat}
126      {==}