Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cnaddid | Structured version Visualization version GIF version |
Description: The group identity element of complex number addition is zero. See also cnfld0 20563. (Contributed by Steve Rodriguez, 3-Dec-2006.) (Revised by AV, 26-Aug-2021.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cnaddabl.g | ⊢ 𝐺 = {〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉} |
Ref | Expression |
---|---|
cnaddid | ⊢ (0g‘𝐺) = 0 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0cn 10627 | . . 3 ⊢ 0 ∈ ℂ | |
2 | cnex 10612 | . . . . 5 ⊢ ℂ ∈ V | |
3 | cnaddabl.g | . . . . . 6 ⊢ 𝐺 = {〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉} | |
4 | 3 | grpbase 16604 | . . . . 5 ⊢ (ℂ ∈ V → ℂ = (Base‘𝐺)) |
5 | 2, 4 | ax-mp 5 | . . . 4 ⊢ ℂ = (Base‘𝐺) |
6 | eqid 2821 | . . . 4 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
7 | addex 12381 | . . . . 5 ⊢ + ∈ V | |
8 | 3 | grpplusg 16605 | . . . . 5 ⊢ ( + ∈ V → + = (+g‘𝐺)) |
9 | 7, 8 | ax-mp 5 | . . . 4 ⊢ + = (+g‘𝐺) |
10 | id 22 | . . . 4 ⊢ (0 ∈ ℂ → 0 ∈ ℂ) | |
11 | addid2 10817 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
12 | 11 | adantl 484 | . . . 4 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0 + 𝑥) = 𝑥) |
13 | addid1 10814 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (𝑥 + 0) = 𝑥) | |
14 | 13 | adantl 484 | . . . 4 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑥 + 0) = 𝑥) |
15 | 5, 6, 9, 10, 12, 14 | ismgmid2 17872 | . . 3 ⊢ (0 ∈ ℂ → 0 = (0g‘𝐺)) |
16 | 1, 15 | ax-mp 5 | . 2 ⊢ 0 = (0g‘𝐺) |
17 | 16 | eqcomi 2830 | 1 ⊢ (0g‘𝐺) = 0 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2110 Vcvv 3495 {cpr 4563 〈cop 4567 ‘cfv 6350 (class class class)co 7150 ℂcc 10529 0cc0 10531 + caddc 10534 ndxcnx 16474 Basecbs 16477 +gcplusg 16559 0gc0g 16707 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-addf 10610 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-n0 11892 df-z 11976 df-uz 12238 df-fz 12887 df-struct 16479 df-ndx 16480 df-slot 16481 df-base 16483 df-plusg 16572 df-0g 16709 |
This theorem is referenced by: cnaddinv 18985 |
Copyright terms: Public domain | W3C validator |