pub broadcast proof fn lemma_u64_shr_is_div(x: u64, shift: u64)
Expand description
requires
0 <= shift < <u64>::BITS,
ensures
#[trigger] (x >> shift) == x as nat / pow2(shift as nat),

Proof that for x and n of type u64 , shifting x right by n is equivalent to division of x by 2^n.