Theorem: ℤθ.my_add_comm (Mordell4/CubicRing.lean)

State before:
a b c : ℤθ
⊢ add a b = add b a
Tactic:
cases a
State after:
case mk
b c : ℤθ
f✝ g✝ h✝ : ℤ
⊢ add { f := f✝, g := g✝, h := h✝ } b = add b { f := f✝, g := g✝, h := h✝ }

State before:
case mk
b c : ℤθ
f✝ g✝ h✝ : ℤ
⊢ add { f := f✝, g := g✝, h := h✝ } b = add b { f := f✝, g := g✝, h := h✝ }
Tactic:
cases b
State after:
case mk.mk
c : ℤθ
f✝¹ g✝¹ h✝¹ f✝ g✝ h✝ : ℤ
⊢ add { f := f✝¹, g := g✝¹, h := h✝¹ } { f := f✝, g := g✝, h := h✝ } =
    add { f := f✝, g := g✝, h := h✝ } { f := f✝¹, g := g✝¹, h := h✝¹ }

State before:
case mk.mk
c : ℤθ
f✝¹ g✝¹ h✝¹ f✝ g✝ h✝ : ℤ
⊢ add { f := f✝¹, g := g✝¹, h := h✝¹ } { f := f✝, g := g✝, h := h✝ } =
    add { f := f✝, g := g✝, h := h✝ } { f := f✝¹, g := g✝¹, h := h✝¹ }
Tactic:
simp only [add, add_comm]
State after:
no goals