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

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

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