![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cncrngOLD | Structured version Visualization version GIF version |
Description: Obsolete version of cncrng 21333 as of 30-Apr-2025. (Contributed by Mario Carneiro, 8-Jan-2015.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cncrngOLD | ⊢ ℂfld ∈ CRing |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnfldbas 21300 | . . . 4 ⊢ ℂ = (Base‘ℂfld) | |
2 | 1 | a1i 11 | . . 3 ⊢ (⊤ → ℂ = (Base‘ℂfld)) |
3 | cnfldadd 21302 | . . . 4 ⊢ + = (+g‘ℂfld) | |
4 | 3 | a1i 11 | . . 3 ⊢ (⊤ → + = (+g‘ℂfld)) |
5 | cnfldmul 21304 | . . . 4 ⊢ · = (.r‘ℂfld) | |
6 | 5 | a1i 11 | . . 3 ⊢ (⊤ → · = (.r‘ℂfld)) |
7 | addcl 11222 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ) | |
8 | addass 11227 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
9 | 0cn 11238 | . . . . 5 ⊢ 0 ∈ ℂ | |
10 | addlid 11429 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
11 | negcl 11492 | . . . . 5 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
12 | addcom 11432 | . . . . . . 7 ⊢ ((-𝑥 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (-𝑥 + 𝑥) = (𝑥 + -𝑥)) | |
13 | 11, 12 | mpancom 686 | . . . . . 6 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = (𝑥 + -𝑥)) |
14 | negid 11539 | . . . . . 6 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
15 | 13, 14 | eqtrd 2765 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = 0) |
16 | 1, 3, 7, 8, 9, 10, 11, 15 | isgrpi 18924 | . . . 4 ⊢ ℂfld ∈ Grp |
17 | 16 | a1i 11 | . . 3 ⊢ (⊤ → ℂfld ∈ Grp) |
18 | mulcl 11224 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
19 | 18 | 3adant1 1127 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) |
20 | mulass 11228 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧))) | |
21 | 20 | adantl 480 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧))) |
22 | adddi 11229 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑥 · (𝑦 + 𝑧)) = ((𝑥 · 𝑦) + (𝑥 · 𝑧))) | |
23 | 22 | adantl 480 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → (𝑥 · (𝑦 + 𝑧)) = ((𝑥 · 𝑦) + (𝑥 · 𝑧))) |
24 | adddir 11237 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧))) | |
25 | 24 | adantl 480 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧))) |
26 | 1cnd 11241 | . . 3 ⊢ (⊤ → 1 ∈ ℂ) | |
27 | mullid 11245 | . . . 4 ⊢ (𝑥 ∈ ℂ → (1 · 𝑥) = 𝑥) | |
28 | 27 | adantl 480 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ) → (1 · 𝑥) = 𝑥) |
29 | mulrid 11244 | . . . 4 ⊢ (𝑥 ∈ ℂ → (𝑥 · 1) = 𝑥) | |
30 | 29 | adantl 480 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ) → (𝑥 · 1) = 𝑥) |
31 | mulcom 11226 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) = (𝑦 · 𝑥)) | |
32 | 31 | 3adant1 1127 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) = (𝑦 · 𝑥)) |
33 | 2, 4, 6, 17, 19, 21, 23, 25, 26, 28, 30, 32 | iscrngd 20240 | . 2 ⊢ (⊤ → ℂfld ∈ CRing) |
34 | 33 | mptru 1540 | 1 ⊢ ℂfld ∈ CRing |
Colors of variables: wff setvar class |
Syntax hints: ∧ w3a 1084 = wceq 1533 ⊤wtru 1534 ∈ wcel 2098 ‘cfv 6549 (class class class)co 7419 ℂcc 11138 0cc0 11140 1c1 11141 + caddc 11143 · cmul 11145 -cneg 11477 Basecbs 17183 +gcplusg 17236 .rcmulr 17237 Grpcgrp 18898 CRingccrg 20186 ℂfldccnfld 21296 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 ax-addf 11219 ax-mulf 11220 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-tp 4635 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-7 12313 df-8 12314 df-9 12315 df-n0 12506 df-z 12592 df-dec 12711 df-uz 12856 df-fz 13520 df-struct 17119 df-sets 17136 df-slot 17154 df-ndx 17166 df-base 17184 df-plusg 17249 df-mulr 17250 df-starv 17251 df-tset 17255 df-ple 17256 df-ds 17258 df-unif 17259 df-0g 17426 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-grp 18901 df-cmn 19749 df-mgp 20087 df-ring 20187 df-cring 20188 df-cnfld 21297 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |