| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnfldneg | Structured version Visualization version GIF version | ||
| Description: The additive inverse in the field of complex numbers. (Contributed by Stefan O'Rear, 27-Nov-2014.) |
| Ref | Expression |
|---|---|
| cnfldneg | ⊢ (𝑋 ∈ ℂ → ((invg‘ℂfld)‘𝑋) = -𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | negid 11643 | . 2 ⊢ (𝑋 ∈ ℂ → (𝑋 + -𝑋) = 0) | |
| 2 | negcl 11595 | . . 3 ⊢ (𝑋 ∈ ℂ → -𝑋 ∈ ℂ) | |
| 3 | cnring 21754 | . . . . 5 ⊢ ℂfld ∈ Ring | |
| 4 | ringgrp 20517 | . . . . 5 ⊢ (ℂfld ∈ Ring → ℂfld ∈ Grp) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ℂfld ∈ Grp |
| 6 | cnfldbas 21735 | . . . . 5 ⊢ ℂ = (Base‘ℂfld) | |
| 7 | cnfldadd 21737 | . . . . 5 ⊢ + = (+g‘ℂfld) | |
| 8 | cnfld0 21756 | . . . . 5 ⊢ 0 = (0g‘ℂfld) | |
| 9 | eqid 2766 | . . . . 5 ⊢ (invg‘ℂfld) = (invg‘ℂfld) | |
| 10 | 6, 7, 8, 9 | grpinvid1 19254 | . . . 4 ⊢ ((ℂfld ∈ Grp ∧ 𝑋 ∈ ℂ ∧ -𝑋 ∈ ℂ) → (((invg‘ℂfld)‘𝑋) = -𝑋 ↔ (𝑋 + -𝑋) = 0)) |
| 11 | 5, 10 | mp3an1 1480 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ -𝑋 ∈ ℂ) → (((invg‘ℂfld)‘𝑋) = -𝑋 ↔ (𝑋 + -𝑋) = 0)) |
| 12 | 2, 11 | mpdan 700 | . 2 ⊢ (𝑋 ∈ ℂ → (((invg‘ℂfld)‘𝑋) = -𝑋 ↔ (𝑋 + -𝑋) = 0)) |
| 13 | 1, 12 | mpbird 260 | 1 ⊢ (𝑋 ∈ ℂ → ((invg‘ℂfld)‘𝑋) = -𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1572 ∈ wcel 2150 ‘cfv 6565 (class class class)co 7450 ℂcc 11236 0cc0 11238 + caddc 11241 -cneg 11580 Grpcgrp 19196 invgcminusg 19197 Ringcrg 20512 ℂfldccnfld 21731 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 ax-addf 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-3 12445 df-4 12446 df-5 12447 df-6 12448 df-7 12449 df-8 12450 df-9 12451 df-n0 12646 df-z 12733 df-dec 12854 df-uz 13005 df-fz 13679 df-struct 17371 df-sets 17388 df-slot 17406 df-ndx 17418 df-base 17434 df-plusg 17488 df-mulr 17489 df-starv 17490 df-tset 17494 df-ple 17495 df-ds 17497 df-unif 17498 df-euf 17501 df-0g 17664 df-mgm 18868 df-sgrp 18960 df-mnd 18976 df-grp 19199 df-minusg 19200 df-cmn 20049 df-mgp 20414 df-ring 20514 df-cring 20515 df-cnfld 21732 |
| This theorem is used by: cnfldsub 21760 cnfldmulg 21764 cnsubglem 21776 zringlpirlem1 21825 prmirred 21837 clmneg 25459 cnncvsabsnegdemo 25543 cphsqrtcl3 25565 rngunsnply 26695 taylply2 26754 qrngneg 28009 constrsdrg 34519 |
| Copyright terms: Public domain | W3C validator |