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

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

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