MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnidOLD Structured version   Visualization version   GIF version

Theorem cnidOLD 28845
Description: Obsolete version of cnaddid 19386. The group identity element of complex number addition is zero. (Contributed by Steve Rodriguez, 3-Dec-2006.) (Revised by Mario Carneiro, 21-Dec-2013.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
cnidOLD 0 = (GId‘ + )

Proof of Theorem cnidOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnaddabloOLD 28844 . . . 4 + ∈ AbelOp
2 ablogrpo 28810 . . . 4 ( + ∈ AbelOp → + ∈ GrpOp)
31, 2ax-mp 5 . . 3 + ∈ GrpOp
4 ax-addf 10881 . . . . . 6 + :(ℂ × ℂ)⟶ℂ
54fdmi 6596 . . . . 5 dom + = (ℂ × ℂ)
63, 5grporn 28784 . . . 4 ℂ = ran +
7 eqid 2738 . . . 4 (GId‘ + ) = (GId‘ + )
86, 7grpoidval 28776 . . 3 ( + ∈ GrpOp → (GId‘ + ) = (𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥))
93, 8ax-mp 5 . 2 (GId‘ + ) = (𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥)
10 addid2 11088 . . . 4 (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥)
1110rgen 3073 . . 3 𝑥 ∈ ℂ (0 + 𝑥) = 𝑥
12 0cn 10898 . . . 4 0 ∈ ℂ
136grpoideu 28772 . . . . 5 ( + ∈ GrpOp → ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥)
143, 13ax-mp 5 . . . 4 ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥
15 oveq1 7262 . . . . . . 7 (𝑦 = 0 → (𝑦 + 𝑥) = (0 + 𝑥))
1615eqeq1d 2740 . . . . . 6 (𝑦 = 0 → ((𝑦 + 𝑥) = 𝑥 ↔ (0 + 𝑥) = 𝑥))
1716ralbidv 3120 . . . . 5 (𝑦 = 0 → (∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥 ↔ ∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥))
1817riota2 7238 . . . 4 ((0 ∈ ℂ ∧ ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) → (∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 ↔ (𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0))
1912, 14, 18mp2an 688 . . 3 (∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 ↔ (𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0)
2011, 19mpbi 229 . 2 (𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0
219, 20eqtr2i 2767 1 0 = (GId‘ + )
Colors of variables: wff setvar class
Syntax hints:  wb 205   = wceq 1539  wcel 2108  wral 3063  ∃!wreu 3065   × cxp 5578  cfv 6418  crio 7211  (class class class)co 7255  cc 10800  0cc0 10802   + caddc 10805  GrpOpcgr 28752  GIdcgi 28753  AbelOpcablo 28807
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-addf 10881
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-po 5494  df-so 5495  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-ltxr 10945  df-sub 11137  df-neg 11138  df-grpo 28756  df-gid 28757  df-ablo 28808
This theorem is referenced by:  cnnv  28940
  Copyright terms: Public domain W3C validator