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

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

State before:
case mk
b c : ℤω
x✝ y✝ : ℤ
⊢ add { x := x✝, y := y✝ } b = add b { x := x✝, y := y✝ }
Tactic:
cases b
State after:
case mk.mk
c : ℤω
x✝¹ y✝¹ x✝ y✝ : ℤ
⊢ add { x := x✝¹, y := y✝¹ } { x := x✝, y := y✝ } = add { x := x✝, y := y✝ } { x := x✝¹, y := y✝¹ }

State before:
case mk.mk
c : ℤω
x✝¹ y✝¹ x✝ y✝ : ℤ
⊢ add { x := x✝¹, y := y✝¹ } { x := x✝, y := y✝ } = add { x := x✝, y := y✝ } { x := x✝¹, y := y✝¹ }
Tactic:
simp only [add, add_comm]
State after:
no goals