Function vstd::bits::lemma_u32_shl_is_mul

source · 
pub broadcast proof fn lemma_u32_shl_is_mul(x: u32, shift: u32)
Expand description
requires
0 <= shift < <u32>::BITS,
x * pow2(shift as nat) <= <u32>::MAX,
ensures
#[trigger] (x << shift) == x * pow2(shift as nat),

Proof that for x and n of type u32 , shifting x left by n is equivalent to multiplication of x by 2^n (provided no overflow).