Theorem: ℤα.my_intCast_neg_succ_of_nat (Mordell4/Rt7Ring.lean)

State before:
a b c : ℤα
⊢ ∀ (n : ℕ), intCast (-↑(n + 1)) = neg (natCast (n + 1))
Tactic:
intro n
State after:
a b c : ℤα
n : ℕ
⊢ intCast (-↑(n + 1)) = neg (natCast (n + 1))

State before:
a b c : ℤα
n : ℕ
⊢ intCast (-↑(n + 1)) = neg (natCast (n + 1))
Tactic:
rfl
State after:
no goals