Theorem: LO.FirstOrder.Arith.Model.mod_add_mul' (Arithmetization/Basic/IOpen.lean)

State before:
M : Type u_1
inst✝⁶ : Zero M
inst✝⁵ : One M
inst✝⁴ : Add M
inst✝³ : Mul M
inst✝² : LT M
inst✝¹ : M ⊧ₘ* 𝐏𝐀⁻
inst✝ : M ⊧ₘ* 𝐈open
c a b : M
pos : 0 < c
⊢ (a + c * b) % c = a % c
Tactic:
simp [mul_comm c b, pos]
State after:
no goals