Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cnegex2 | Structured version Visualization version GIF version |
Description: Existence of a left inverse for addition. (Contributed by Scott Fenton, 3-Jan-2013.) |
Ref | Expression |
---|---|
cnegex2 | ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-icn 10598 | . . . 4 ⊢ i ∈ ℂ | |
2 | 1, 1 | mulcli 10650 | . . 3 ⊢ (i · i) ∈ ℂ |
3 | mulcl 10623 | . . 3 ⊢ (((i · i) ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((i · i) · 𝐴) ∈ ℂ) | |
4 | 2, 3 | mpan 688 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · i) · 𝐴) ∈ ℂ) |
5 | mulid2 10642 | . . . 4 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) | |
6 | 5 | oveq2d 7174 | . . 3 ⊢ (𝐴 ∈ ℂ → (((i · i) · 𝐴) + (1 · 𝐴)) = (((i · i) · 𝐴) + 𝐴)) |
7 | ax-i2m1 10607 | . . . . 5 ⊢ ((i · i) + 1) = 0 | |
8 | 7 | oveq1i 7168 | . . . 4 ⊢ (((i · i) + 1) · 𝐴) = (0 · 𝐴) |
9 | ax-1cn 10597 | . . . . 5 ⊢ 1 ∈ ℂ | |
10 | adddir 10634 | . . . . 5 ⊢ (((i · i) ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (((i · i) + 1) · 𝐴) = (((i · i) · 𝐴) + (1 · 𝐴))) | |
11 | 2, 9, 10 | mp3an12 1447 | . . . 4 ⊢ (𝐴 ∈ ℂ → (((i · i) + 1) · 𝐴) = (((i · i) · 𝐴) + (1 · 𝐴))) |
12 | mul02 10820 | . . . 4 ⊢ (𝐴 ∈ ℂ → (0 · 𝐴) = 0) | |
13 | 8, 11, 12 | 3eqtr3a 2882 | . . 3 ⊢ (𝐴 ∈ ℂ → (((i · i) · 𝐴) + (1 · 𝐴)) = 0) |
14 | 6, 13 | eqtr3d 2860 | . 2 ⊢ (𝐴 ∈ ℂ → (((i · i) · 𝐴) + 𝐴) = 0) |
15 | oveq1 7165 | . . . 4 ⊢ (𝑥 = ((i · i) · 𝐴) → (𝑥 + 𝐴) = (((i · i) · 𝐴) + 𝐴)) | |
16 | 15 | eqeq1d 2825 | . . 3 ⊢ (𝑥 = ((i · i) · 𝐴) → ((𝑥 + 𝐴) = 0 ↔ (((i · i) · 𝐴) + 𝐴) = 0)) |
17 | 16 | rspcev 3625 | . 2 ⊢ ((((i · i) · 𝐴) ∈ ℂ ∧ (((i · i) · 𝐴) + 𝐴) = 0) → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0) |
18 | 4, 14, 17 | syl2anc 586 | 1 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ∃wrex 3141 (class class class)co 7158 ℂcc 10537 0cc0 10539 1c1 10540 ici 10541 + caddc 10542 · cmul 10544 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-po 5476 df-so 5477 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-ltxr 10682 |
This theorem is referenced by: addcan 10826 |
Copyright terms: Public domain | W3C validator |