| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnidOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of cnaddid 19816. 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.) |
| Ref | Expression |
|---|---|
| cnidOLD | ⊢ 0 = (GId‘ + ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnaddabloOLD 30675 | . . . 4 ⊢ + ∈ AbelOp | |
| 2 | ablogrpo 30641 | . . . 4 ⊢ ( + ∈ AbelOp → + ∈ GrpOp) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ + ∈ GrpOp |
| 4 | ax-addf 11119 | . . . . . 6 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 5 | 4 | fdmi 6683 | . . . . 5 ⊢ dom + = (ℂ × ℂ) |
| 6 | 3, 5 | grporn 30615 | . . . 4 ⊢ ℂ = ran + |
| 7 | eqid 2737 | . . . 4 ⊢ (GId‘ + ) = (GId‘ + ) | |
| 8 | 6, 7 | grpoidval 30607 | . . 3 ⊢ ( + ∈ GrpOp → (GId‘ + ) = (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥)) |
| 9 | 3, 8 | ax-mp 5 | . 2 ⊢ (GId‘ + ) = (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) |
| 10 | addlid 11330 | . . . 4 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
| 11 | 10 | rgen 3054 | . . 3 ⊢ ∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 |
| 12 | 0cn 11138 | . . . 4 ⊢ 0 ∈ ℂ | |
| 13 | 6 | grpoideu 30603 | . . . . 5 ⊢ ( + ∈ GrpOp → ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) |
| 14 | 3, 13 | ax-mp 5 | . . . 4 ⊢ ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥 |
| 15 | oveq1 7377 | . . . . . . 7 ⊢ (𝑦 = 0 → (𝑦 + 𝑥) = (0 + 𝑥)) | |
| 16 | 15 | eqeq1d 2739 | . . . . . 6 ⊢ (𝑦 = 0 → ((𝑦 + 𝑥) = 𝑥 ↔ (0 + 𝑥) = 𝑥)) |
| 17 | 16 | ralbidv 3161 | . . . . 5 ⊢ (𝑦 = 0 → (∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥 ↔ ∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥)) |
| 18 | 17 | riota2 7352 | . . . 4 ⊢ ((0 ∈ ℂ ∧ ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) → (∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 ↔ (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0)) |
| 19 | 12, 14, 18 | mp2an 693 | . . 3 ⊢ (∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 ↔ (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0) |
| 20 | 11, 19 | mpbi 230 | . 2 ⊢ (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0 |
| 21 | 9, 20 | eqtr2i 2761 | 1 ⊢ 0 = (GId‘ + ) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃!wreu 3350 × cxp 5632 ‘cfv 6502 ℩crio 7326 (class class class)co 7370 ℂcc 11038 0cc0 11040 + caddc 11043 GrpOpcgr 30583 GIdcgi 30584 AbelOpcablo 30638 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-addf 11119 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-po 5542 df-so 5543 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-pnf 11182 df-mnf 11183 df-ltxr 11185 df-sub 11380 df-neg 11381 df-grpo 30587 df-gid 30588 df-ablo 30639 |
| This theorem is referenced by: cnnv 30771 |
| Copyright terms: Public domain | W3C validator |