| 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 19881. 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 11140 | . . 3 ⊢ ℂ ∈ V | |
| 2 | ax-addf 11138 | . . 3 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 3 | addass 11146 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 4 | 0cn 11157 | . . 3 ⊢ 0 ∈ ℂ | |
| 5 | addlid 11352 | . . 3 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
| 6 | negcl 11416 | . . 3 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
| 7 | addcom 11355 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) | |
| 8 | 6, 7 | mpdan 695 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
| 9 | negid 11464 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
| 10 | 8, 9 | eqtr3d 2789 | . . 3 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = 0) |
| 11 | 1, 2, 3, 4, 5, 6, 10 | isgrpoi 30636 | . 2 ⊢ + ∈ GrpOp |
| 12 | 2 | fdmi 6688 | . 2 ⊢ dom + = (ℂ × ℂ) |
| 13 | addcom 11355 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
| 14 | 11, 12, 13 | isabloi 30689 | 1 ⊢ + ∈ AbelOp |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1550 ∈ wcel 2132 × cxp 5634 (class class class)co 7381 ℂcc 11057 0cc0 11059 + caddc 11062 -cneg 11401 AbelOpcablo 30682 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-addf 11138 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-id 5531 df-po 5544 df-so 5545 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-pnf 11204 df-mnf 11205 df-ltxr 11207 df-sub 11402 df-neg 11403 df-grpo 30631 df-ablo 30683 |
| This theorem is referenced by: cnidOLD 30720 cncvcOLD 30721 cnnv 30815 cnnvba 30817 cncph 30957 |
| Copyright terms: Public domain | W3C validator |