Theorem: ℤω.my_mul_zero (Mordell4/Eisenstein.lean)

State before:
a b c : ℤω
⊢ mul a zero = zero
Tactic:
cases a
State after:
case mk
b c : ℤω
x✝ y✝ : ℤ
⊢ mul { x := x✝, y := y✝ } zero = zero

State before:
case mk
b c : ℤω
x✝ y✝ : ℤ
⊢ mul { x := x✝, y := y✝ } zero = zero
Tactic:
simp [mul, zero]
State after:
no goals