| 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 20084. 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 11282 | . . 3 ⊢ ℂ ∈ V | |
| 2 | ax-addf 11280 | . . 3 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 3 | addass 11288 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 4 | 0cn 11299 | . . 3 ⊢ 0 ∈ ℂ | |
| 5 | addlid 11494 | . . 3 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
| 6 | negcl 11558 | . . 3 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
| 7 | addcom 11497 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = ( -𝑥 + 𝑥)) | |
| 8 | 6, 7 | mpdan 700 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = ( -𝑥 + 𝑥)) |
| 9 | negid 11606 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
| 10 | 8, 9 | eqtr3d 2798 | . . 3 ⊢ (𝑥 ∈ ℂ → ( -𝑥 + 𝑥) = 0) |
| 11 | 1, 2, 3, 4, 5, 6, 10 | isgrpoi 31101 | . 2 ⊢ + ∈ GrpOp |
| 12 | 2 | fdmi 6722 | . 2 ⊢ dom + = (ℂ × ℂ) |
| 13 | addcom 11497 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
| 14 | 11, 12, 13 | isabloi 31154 | 1 ⊢ + ∈ AbelOp |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 × cxp 5649 (class class class)co 7421 ℂcc 11199 0cc0 11201 + caddc 11204 -cneg 11543 AbelOpcablo 31147 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7752 ax-cnex 11257 ax-resscn 11258 ax-1cn 11259 ax-icn 11260 ax-addcl 11261 ax-addrcl 11262 ax-mulcl 11263 ax-mulrcl 11264 ax-mulcom 11265 ax-addass 11266 ax-mulass 11267 ax-distr 11268 ax-i2m1 11269 ax-1ne0 11270 ax-1rid 11271 ax-rnegex 11272 ax-rrecex 11273 ax-cnre 11274 ax-pre-lttri 11275 ax-pre-lttrn 11276 ax-pre-ltadd 11277 ax-addf 11280 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3900 df-un 3902 df-in 3904 df-ss 3915 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-er 8718 df-en 8975 df-dom 8976 df-sdom 8977 df-pnf 11346 df-mnf 11347 df-ltxr 11349 df-sub 11544 df-neg 11545 df-grpo 31096 df-ablo 31148 |
| This theorem is used by: cnidOLD 31185 cncvcOLD 31186 cnnv 31280 cnnvba 31282 cncph 31422 |
| Copyright terms: Public domain | W3C validator |