pub broadcast proof fn lemma_mod_multiples_basic(x: int, m: int)Expand description
requires
m > 0,#[trigger] ((x * m) % m) == 0,Proof that multiplying by a number then dividing by that same
number produces a remainder of 0. Specifically, (x * m) % m == 0.