| 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.) Revise df-cnfld 21712. (Revised by GG, 31-Mar-2025.) |
| Ref | Expression |
|---|---|
| cnfldstr | ⊢ ℂfld Struct 〈1, ;13〉 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-cnfld 21712 | . 2 ⊢ ℂfld = (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) | |
| 2 | eqid 2763 | . . . 4 ⊢ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) = ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) | |
| 3 | 2 | srngstr 17512 | . . 3 ⊢ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) Struct 〈1, 4〉 |
| 4 | 9nn 12471 | . . . . 5 ⊢ 9 ∈ ℕ | |
| 5 | tsetndx 17555 | . . . . 5 ⊢ (TopSet‘ndx) = 9 | |
| 6 | 9lt10 12981 | . . . . 5 ⊢ 9 < ;10 | |
| 7 | 10nn 12864 | . . . . 5 ⊢ ;10 ∈ ℕ | |
| 8 | plendx 17569 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 9 | 1nn0 12652 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 10 | 0nn0 12651 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 11 | 2nn 12446 | . . . . . 6 ⊢ 2 ∈ ℕ | |
| 12 | 2pos 12477 | . . . . . 6 ⊢ 0 < 2 | |
| 13 | 9, 10, 11, 12 | declt 12877 | . . . . 5 ⊢ ;10 < ;12 |
| 14 | 9, 11 | decnncl 12868 | . . . . 5 ⊢ ;12 ∈ ℕ |
| 15 | dsndx 17588 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 16 | 4, 5, 6, 7, 8, 13, 14, 15 | strle3 17370 | . . . 4 ⊢ {〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} Struct 〈9, ;12〉 |
| 17 | 3nn 12452 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 18 | 9, 17 | decnncl 12868 | . . . . 5 ⊢ ;13 ∈ ℕ |
| 19 | unifndx 17598 | . . . . 5 ⊢ (UnifSet‘ndx) = ;13 | |
| 20 | 18, 19 | strle1 17368 | . . . 4 ⊢ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉} Struct 〈;13, ;13〉 |
| 21 | 2nn0 12653 | . . . . 5 ⊢ 2 ∈ ℕ0 | |
| 22 | 2lt3 12546 | . . . . 5 ⊢ 2 < 3 | |
| 23 | 9, 21, 17, 22 | declt 12877 | . . . 4 ⊢ ;12 < ;13 |
| 24 | 16, 20, 23 | strleun 17367 | . . 3 ⊢ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉}) Struct 〈9, ;13〉 |
| 25 | 4lt9 12578 | . . 3 ⊢ 4 < 9 | |
| 26 | 3, 24, 25 | strleun 17367 | . 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 5130 | 1 ⊢ ℂfld Struct 〈1, ;13〉 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∪ cun 4152 {csn 4588 {ctp 4592 〈cop 4838 class class class wbr 5106 ∘ ccom 5660 ‘cfv 6561 (class class class)co 7446 ∈ cmpo 7448 ℂcc 11228 0cc0 11230 1c1 11231 + caddc 11233 · cmul 11235 ≤ cle 11374 − cmin 11571 2c2 12427 3c3 12428 4c4 12429 9c9 12434 ;cdc 12844 ∗ccj 15295 abscabs 15433 Struct cstr 17356 ndxcnx 17403 Basecbs 17419 +gcplusg 17460 .rcmulr 17461 *𝑟cstv 17462 TopSetcts 17466 lecple 17467 distcds 17469 UnifSetcunif 17470 MetOpencmopn 21701 metUnifcmetu 21702 ℂfldccnfld 21711 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-3 12436 df-4 12437 df-5 12438 df-6 12439 df-7 12440 df-8 12441 df-9 12442 df-n0 12637 df-z 12724 df-dec 12845 df-uz 12996 df-fz 13670 df-struct 17357 df-slot 17392 df-ndx 17404 df-base 17420 df-plusg 17473 df-mulr 17474 df-starv 17475 df-tset 17479 df-ple 17480 df-ds 17482 df-unif 17483 df-cnfld 21712 |
| This theorem is used by: cnfldbas 21715 mpocnfldadd 21716 mpocnfldmul 21718 cnfldcj 21720 cnfldtset 21721 cnfldle 21722 cnfldds 21723 cnfldunif 21724 cnfldfun 21725 cffldtocusgr 30061 |
| Copyright terms: Public domain | W3C validator |