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 19565. 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 11057 | . . 3 ⊢ ℂ ∈ V | |
2 | ax-addf 11055 | . . 3 ⊢ + :(ℂ × ℂ)⟶ℂ | |
3 | addass 11063 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
4 | 0cn 11072 | . . 3 ⊢ 0 ∈ ℂ | |
5 | addid2 11263 | . . 3 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
6 | negcl 11326 | . . 3 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
7 | addcom 11266 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) | |
8 | 6, 7 | mpdan 685 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
9 | negid 11373 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
10 | 8, 9 | eqtr3d 2779 | . . 3 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = 0) |
11 | 1, 2, 3, 4, 5, 6, 10 | isgrpoi 29147 | . 2 ⊢ + ∈ GrpOp |
12 | 2 | fdmi 6667 | . 2 ⊢ dom + = (ℂ × ℂ) |
13 | addcom 11266 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
14 | 11, 12, 13 | isabloi 29200 | 1 ⊢ + ∈ AbelOp |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ∈ wcel 2106 × cxp 5622 (class class class)co 7341 ℂcc 10974 0cc0 10976 + caddc 10979 -cneg 11311 AbelOpcablo 29193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-rep 5233 ax-sep 5247 ax-nul 5254 ax-pow 5312 ax-pr 5376 ax-un 7654 ax-cnex 11032 ax-resscn 11033 ax-1cn 11034 ax-icn 11035 ax-addcl 11036 ax-addrcl 11037 ax-mulcl 11038 ax-mulrcl 11039 ax-mulcom 11040 ax-addass 11041 ax-mulass 11042 ax-distr 11043 ax-i2m1 11044 ax-1ne0 11045 ax-1rid 11046 ax-rnegex 11047 ax-rrecex 11048 ax-cnre 11049 ax-pre-lttri 11050 ax-pre-lttrn 11051 ax-pre-ltadd 11052 ax-addf 11055 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3351 df-rab 3405 df-v 3444 df-sbc 3731 df-csb 3847 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4274 df-if 4478 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4857 df-iun 4947 df-br 5097 df-opab 5159 df-mpt 5180 df-id 5522 df-po 5536 df-so 5537 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6435 df-fun 6485 df-fn 6486 df-f 6487 df-f1 6488 df-fo 6489 df-f1o 6490 df-fv 6491 df-riota 7297 df-ov 7344 df-oprab 7345 df-mpo 7346 df-er 8573 df-en 8809 df-dom 8810 df-sdom 8811 df-pnf 11116 df-mnf 11117 df-ltxr 11119 df-sub 11312 df-neg 11313 df-grpo 29142 df-ablo 29194 |
This theorem is referenced by: cnidOLD 29231 cncvcOLD 29232 cnnv 29326 cnnvba 29328 cncph 29468 |
Copyright terms: Public domain | W3C validator |