Metamath Proof Explorer


Theorem sn-negex

Description: Proof of cnegex without ax-mulcom . (Contributed by SN, 30-Apr-2024)

Ref Expression
Assertion sn-negex ⊢ A ∈ ℂ → ∃ b ∈ ℂ A + b = 0

Proof

Step Hyp Ref Expression
1 sn-negex12 ⊢ A ∈ ℂ → ∃ b ∈ ℂ A + b = 0 ∧ b + A = 0
2 simpl ⊢ A + b = 0 ∧ b + A = 0 → A + b = 0
3 2 reximi ⊢ ∃ b ∈ ℂ A + b = 0 ∧ b + A = 0 → ∃ b ∈ ℂ A + b = 0
4 1 3 syl ⊢ A ∈ ℂ → ∃ b ∈ ℂ A + b = 0