theorem eqmeq2 (n _a1 _a2 b: nat): $ _a1 = _a2 -> (mod(n): _a1 = b <-> mod(n): _a2 = b) $;
_a1 = _a2 -> _a1 = _a2
_a1 = _a2 -> (mod(n): _a1 = b <-> mod(n): _a2 = b)