Metamath Proof Explorer


Theorem neg11i

Description: Negative is one-to-one. (Contributed by NM, 1-Aug-1999)

Ref Expression
Hypotheses negidi.1 ⊢ A ∈ ℂ
pncan3i.2 ⊢ B ∈ ℂ
Assertion neg11i ⊢ − A = − B ↔ A = B

Proof

Step Hyp Ref Expression
1 negidi.1 ⊢ A ∈ ℂ
2 pncan3i.2 ⊢ B ∈ ℂ
3 neg11 ⊢ A ∈ ℂ ∧ B ∈ ℂ → − A = − B ↔ A = B
4 1 2 3 mp2an ⊢ − A = − B ↔ A = B