def sb

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/secp256k1/u32and.bend:19

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/lib/lemmas/spec/numeric.bend as S

19def sb(+k: Nat, +x: Nat) -> {S.scale_binary(k, x) == C.shift(k, x) : Nat}:
20  match k:
21    case 0n:
22      {==}
23    case 1n+ +p:
24      Equal.cong(Nat, Nat, t => Nat.double(t), S.scale_binary(p, x), C.shift(p, x), sb(p, x))