| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnaddabloOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of cnaddabl 20044. Complex number addition is an Abelian group operation. (Contributed by NM, 5-Nov-2006.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| cnaddabloOLD | ⊢ + ∈ AbelOp |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnex 11252 | . . 3 ⊢ ℂ ∈ V | |
| 2 | ax-addf 11250 | . . 3 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 3 | addass 11258 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 4 | 0cn 11269 | . . 3 ⊢ 0 ∈ ℂ | |
| 5 | addlid 11464 | . . 3 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
| 6 | negcl 11528 | . . 3 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
| 7 | addcom 11467 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) | |
| 8 | 6, 7 | mpdan 700 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
| 9 | negid 11576 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
| 10 | 8, 9 | eqtr3d 2797 | . . 3 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = 0) |
| 11 | 1, 2, 3, 4, 5, 6, 10 | isgrpoi 31033 | . 2 ⊢ + ∈ GrpOp |
| 12 | 2 | fdmi 6709 | . 2 ⊢ dom + = (ℂ × ℂ) |
| 13 | addcom 11467 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
| 14 | 11, 12, 13 | isabloi 31086 | 1 ⊢ + ∈ AbelOp |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 × cxp 5645 (class class class)co 7408 ℂcc 11169 0cc0 11171 + caddc 11174 -cneg 11513 AbelOpcablo 31079 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-addf 11250 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-ltxr 11319 df-sub 11514 df-neg 11515 df-grpo 31028 df-ablo 31080 |
| This theorem is used by: cnidOLD 31117 cncvcOLD 31118 cnnv 31212 cnnvba 31214 cncph 31354 |
| Copyright terms: Public domain | W3C validator |