| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cncrng | GIF version | ||
| Description: The complex numbers form a commutative ring. (Contributed by Mario Carneiro, 8-Jan-2015.) |
| Ref | Expression |
|---|---|
| cncrng | ⊢ ℂfld ∈ CRing |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnfldbas 14540 | . . . 4 ⊢ ℂ = (Base‘ℂfld) | |
| 2 | 1 | a1i 9 | . . 3 ⊢ (⊤ → ℂ = (Base‘ℂfld)) |
| 3 | cnfldadd 14542 | . . . 4 ⊢ + = (+g‘ℂfld) | |
| 4 | 3 | a1i 9 | . . 3 ⊢ (⊤ → + = (+g‘ℂfld)) |
| 5 | cnfldmul 14544 | . . . 4 ⊢ · = (.r‘ℂfld) | |
| 6 | 5 | a1i 9 | . . 3 ⊢ (⊤ → · = (.r‘ℂfld)) |
| 7 | addcl 8135 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ) | |
| 8 | addass 8140 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 9 | 0cn 8149 | . . . . 5 ⊢ 0 ∈ ℂ | |
| 10 | addlid 8296 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
| 11 | negcl 8357 | . . . . 5 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
| 12 | addcom 8294 | . . . . . . 7 ⊢ ((-𝑥 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (-𝑥 + 𝑥) = (𝑥 + -𝑥)) | |
| 13 | 11, 12 | mpancom 422 | . . . . . 6 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = (𝑥 + -𝑥)) |
| 14 | negid 8404 | . . . . . 6 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
| 15 | 13, 14 | eqtrd 2262 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = 0) |
| 16 | 1, 3, 7, 8, 9, 10, 11, 15 | isgrpi 13573 | . . . 4 ⊢ ℂfld ∈ Grp |
| 17 | 16 | a1i 9 | . . 3 ⊢ (⊤ → ℂfld ∈ Grp) |
| 18 | mulcl 8137 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
| 19 | 18 | 3adant1 1039 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) |
| 20 | mulass 8141 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧))) | |
| 21 | 20 | adantl 277 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧))) |
| 22 | adddi 8142 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑥 · (𝑦 + 𝑧)) = ((𝑥 · 𝑦) + (𝑥 · 𝑧))) | |
| 23 | 22 | adantl 277 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → (𝑥 · (𝑦 + 𝑧)) = ((𝑥 · 𝑦) + (𝑥 · 𝑧))) |
| 24 | adddir 8148 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧))) | |
| 25 | 24 | adantl 277 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧))) |
| 26 | 1cnd 8173 | . . 3 ⊢ (⊤ → 1 ∈ ℂ) | |
| 27 | mullid 8155 | . . . 4 ⊢ (𝑥 ∈ ℂ → (1 · 𝑥) = 𝑥) | |
| 28 | 27 | adantl 277 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ) → (1 · 𝑥) = 𝑥) |
| 29 | mulrid 8154 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 · 1) = 𝑥) | |
| 30 | 29 | adantl 277 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ) → (𝑥 · 1) = 𝑥) |
| 31 | mulcom 8139 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) = (𝑦 · 𝑥)) | |
| 32 | 31 | 3adant1 1039 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) = (𝑦 · 𝑥)) |
| 33 | 2, 4, 6, 17, 19, 21, 23, 25, 26, 28, 30, 32 | iscrngd 14021 | . 2 ⊢ (⊤ → ℂfld ∈ CRing) |
| 34 | 33 | mptru 1404 | 1 ⊢ ℂfld ∈ CRing |
| Colors of variables: wff set class |
| Syntax hints: ∧ w3a 1002 = wceq 1395 ⊤wtru 1396 ∈ wcel 2200 ‘cfv 5318 (class class class)co 6007 ℂcc 8008 0cc0 8010 1c1 8011 + caddc 8013 · cmul 8015 -cneg 8329 Basecbs 13048 +gcplusg 13126 .rcmulr 13127 Grpcgrp 13549 CRingccrg 13976 ℂfldccnfld 14536 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-addf 8132 ax-mulf 8133 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-tp 3674 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-5 9183 df-6 9184 df-7 9185 df-8 9186 df-9 9187 df-n0 9381 df-z 9458 df-dec 9590 df-uz 9734 df-rp 9862 df-fz 10217 df-cj 11369 df-abs 11526 df-struct 13050 df-ndx 13051 df-slot 13052 df-base 13054 df-sets 13055 df-plusg 13139 df-mulr 13140 df-starv 13141 df-tset 13145 df-ple 13146 df-ds 13148 df-unif 13149 df-0g 13307 df-topgen 13309 df-mgm 13405 df-sgrp 13451 df-mnd 13466 df-grp 13552 df-cmn 13839 df-mgp 13900 df-ring 13977 df-cring 13978 df-bl 14526 df-mopn 14527 df-fg 14529 df-metu 14530 df-cnfld 14537 |
| This theorem is referenced by: cnring 14550 cnfldui 14569 zringcrng 14572 zring0 14580 |
| Copyright terms: Public domain | W3C validator |