def pow2_pow

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/u32.bend:32

import Base
import bend-collections-laws-crypto@1.0.0.0/spec/lib/common.bend as SC

32def pow2_pow(+k: Nat) -> {SC.pow2(k) == Nat.pow(2n, k) : Nat}:
33  match k:
34    case 0n:
35      {==}
36    case 1n+p:
37      %pow2_pow(p) : {Nat.double(SC.pow2(p)) == Nat.add(_, Nat.add(_, 0n)) : Nat}
38      double_pow(SC.pow2(p))