![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cnfldstr | Structured version Visualization version GIF version |
Description: The field of complex numbers is a structure. (Contributed by Mario Carneiro, 14-Aug-2015.) (Revised by Thierry Arnoux, 17-Dec-2017.) |
Ref | Expression |
---|---|
cnfldstr | ⊢ ℂfld Struct 〈1, ;13〉 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-cnfld 20092 | . 2 ⊢ ℂfld = (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) | |
2 | eqid 2798 | . . . 4 ⊢ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗〉}) = ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗〉}) | |
3 | 2 | srngstr 16619 | . . 3 ⊢ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗〉}) Struct 〈1, 4〉 |
4 | 9nn 11723 | . . . . 5 ⊢ 9 ∈ ℕ | |
5 | tsetndx 16651 | . . . . 5 ⊢ (TopSet‘ndx) = 9 | |
6 | 9lt10 12217 | . . . . 5 ⊢ 9 < ;10 | |
7 | 10nn 12102 | . . . . 5 ⊢ ;10 ∈ ℕ | |
8 | plendx 16658 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
9 | 1nn0 11901 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
10 | 0nn0 11900 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
11 | 2nn 11698 | . . . . . 6 ⊢ 2 ∈ ℕ | |
12 | 2pos 11728 | . . . . . 6 ⊢ 0 < 2 | |
13 | 9, 10, 11, 12 | declt 12114 | . . . . 5 ⊢ ;10 < ;12 |
14 | 9, 11 | decnncl 12106 | . . . . 5 ⊢ ;12 ∈ ℕ |
15 | dsndx 16667 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
16 | 4, 5, 6, 7, 8, 13, 14, 15 | strle3 16586 | . . . 4 ⊢ {〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} Struct 〈9, ;12〉 |
17 | 3nn 11704 | . . . . . 6 ⊢ 3 ∈ ℕ | |
18 | 9, 17 | decnncl 12106 | . . . . 5 ⊢ ;13 ∈ ℕ |
19 | unifndx 16669 | . . . . 5 ⊢ (UnifSet‘ndx) = ;13 | |
20 | 18, 19 | strle1 16584 | . . . 4 ⊢ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉} Struct 〈;13, ;13〉 |
21 | 2nn0 11902 | . . . . 5 ⊢ 2 ∈ ℕ0 | |
22 | 2lt3 11797 | . . . . 5 ⊢ 2 < 3 | |
23 | 9, 21, 17, 22 | declt 12114 | . . . 4 ⊢ ;12 < ;13 |
24 | 16, 20, 23 | strleun 16583 | . . 3 ⊢ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉}) Struct 〈9, ;13〉 |
25 | 4lt9 11828 | . . 3 ⊢ 4 < 9 | |
26 | 3, 24, 25 | strleun 16583 | . 2 ⊢ (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) Struct 〈1, ;13〉 |
27 | 1, 26 | eqbrtri 5051 | 1 ⊢ ℂfld Struct 〈1, ;13〉 |
Colors of variables: wff setvar class |
Syntax hints: ∪ cun 3879 {csn 4525 {ctp 4529 〈cop 4531 class class class wbr 5030 ∘ ccom 5523 ‘cfv 6324 ℂcc 10524 0cc0 10526 1c1 10527 + caddc 10529 · cmul 10531 ≤ cle 10665 − cmin 10859 2c2 11680 3c3 11681 4c4 11682 9c9 11687 ;cdc 12086 ∗ccj 14447 abscabs 14585 Struct cstr 16471 ndxcnx 16472 Basecbs 16475 +gcplusg 16557 .rcmulr 16558 *𝑟cstv 16559 TopSetcts 16563 lecple 16564 distcds 16566 UnifSetcunif 16567 MetOpencmopn 20081 metUnifcmetu 20082 ℂfldccnfld 20091 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-fz 12886 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-plusg 16570 df-mulr 16571 df-starv 16572 df-tset 16576 df-ple 16577 df-ds 16579 df-unif 16580 df-cnfld 20092 |
This theorem is referenced by: cnfldex 20094 cnfldbas 20095 cnfldadd 20096 cnfldmul 20097 cnfldcj 20098 cnfldtset 20099 cnfldle 20100 cnfldds 20101 cnfldunif 20102 cnfldfunALT 20104 cffldtocusgr 27237 |
Copyright terms: Public domain | W3C validator |