| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnaddabl | Structured version Visualization version GIF version | ||
| Description: The complex numbers are an Abelian group under addition. This version of cnaddablx 19786 hides the explicit structure indices i.e. is "scaffold-independent". Note that the proof also does not reference explicit structure indices. The actual structure is dependent on how Base and +g is defined. This theorem should not be referenced in any proof. For the group/ring properties of the complex numbers, see cnring 21333. (Contributed by NM, 20-Oct-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cnaddabl.g | ⊢ 𝐺 = {〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉} |
| Ref | Expression |
|---|---|
| cnaddabl | ⊢ 𝐺 ∈ Abel |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnex 11093 | . . . 4 ⊢ ℂ ∈ V | |
| 2 | cnaddabl.g | . . . . 5 ⊢ 𝐺 = {〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉} | |
| 3 | 2 | grpbase 17199 | . . . 4 ⊢ (ℂ ∈ V → ℂ = (Base‘𝐺)) |
| 4 | 1, 3 | ax-mp 5 | . . 3 ⊢ ℂ = (Base‘𝐺) |
| 5 | addex 12893 | . . . 4 ⊢ + ∈ V | |
| 6 | 2 | grpplusg 17200 | . . . 4 ⊢ ( + ∈ V → + = (+g‘𝐺)) |
| 7 | 5, 6 | ax-mp 5 | . . 3 ⊢ + = (+g‘𝐺) |
| 8 | addcl 11094 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ) | |
| 9 | addass 11099 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 10 | 0cn 11110 | . . 3 ⊢ 0 ∈ ℂ | |
| 11 | addlid 11302 | . . 3 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
| 12 | negcl 11366 | . . 3 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
| 13 | addcom 11305 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) | |
| 14 | 12, 13 | mpdan 687 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
| 15 | negid 11414 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
| 16 | 14, 15 | eqtr3d 2768 | . . 3 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = 0) |
| 17 | 4, 7, 8, 9, 10, 11, 12, 16 | isgrpi 18878 | . 2 ⊢ 𝐺 ∈ Grp |
| 18 | addcom 11305 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
| 19 | 17, 4, 7, 18 | isabli 19714 | 1 ⊢ 𝐺 ∈ Abel |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∈ wcel 2111 Vcvv 3436 {cpr 4577 〈cop 4581 ‘cfv 6487 (class class class)co 7352 ℂcc 11010 0cc0 11012 + caddc 11015 -cneg 11351 ndxcnx 17110 Basecbs 17126 +gcplusg 17167 Abelcabl 19699 |
| 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 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11068 ax-resscn 11069 ax-1cn 11070 ax-icn 11071 ax-addcl 11072 ax-addrcl 11073 ax-mulcl 11074 ax-mulrcl 11075 ax-mulcom 11076 ax-addass 11077 ax-mulass 11078 ax-distr 11079 ax-i2m1 11080 ax-1ne0 11081 ax-1rid 11082 ax-rnegex 11083 ax-rrecex 11084 ax-cnre 11085 ax-pre-lttri 11086 ax-pre-lttrn 11087 ax-pre-ltadd 11088 ax-pre-mulgt0 11089 ax-addf 11091 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-pnf 11154 df-mnf 11155 df-xr 11156 df-ltxr 11157 df-le 11158 df-sub 11352 df-neg 11353 df-nn 12132 df-2 12194 df-n0 12388 df-z 12475 df-uz 12739 df-fz 13414 df-struct 17064 df-slot 17099 df-ndx 17111 df-base 17127 df-plusg 17180 df-0g 17351 df-mgm 18554 df-sgrp 18633 df-mnd 18649 df-grp 18855 df-cmn 19700 df-abl 19701 |
| This theorem is referenced by: cnaddinv 19789 cnaddcom 39077 |
| Copyright terms: Public domain | W3C validator |