grind
(x - y).toNat
x.toNat
y.toNat
%
fun_cases
BuiltinNotation
Sym.simp
inline
@[always_inline, inline]
ST.RefPointed
a % k
a
lia
0 ≤ a < k
match
unfold
eq_def
pure ()