Theorem: LoVe.Int.zero_eq_mul (LoVe/LoVelib.lean)

State before:
a b : ℤ
⊢ 0 = a * b ↔ a = 0 ∨ b = 0
Tactic:
rw [eq_comm]
State after:
a b : ℤ
⊢ a * b = 0 ↔ a = 0 ∨ b = 0

State before:
a b : ℤ
⊢ a * b = 0 ↔ a = 0 ∨ b = 0
Tactic:
exact Int.mul_eq_zero
State after:
no goals