vstd::bits

Function lemma_u32_pow2_no_overflow

Source 
pub broadcast proof fn lemma_u32_pow2_no_overflow(n: nat)
Expand description
requires
0 <= n < <u32>::BITS,
ensures
0 < #[trigger] pow2(n) < <u32>::MAX,

Proof that 2^n does not overflow u32 for an exponent n.