MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnfldex Structured version   Visualization version   GIF version

Theorem cnfldex 21714
Description: The field of complex numbers is a set. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 14-Aug-2015.) (Revised by Thierry Arnoux, 17-Dec-2017.) Avoid complex number axioms and ax-pow 5332. (Revised by GG, 16-Mar-2025.)
Assertion
Ref Expression
cnfldex ℂfld ∈ V

Proof of Theorem cnfldex
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef 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 tpex 7789 . . . 4 {⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩} ∈ V
3 snex 5402 . . . 4 {⟨(*𝑟‘ndx), ∗⟩} ∈ V
42, 3unex 7788 . . 3 ({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) ∈ V
5 tpex 7789 . . . 4 {⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∈ V
6 snex 5402 . . . 4 {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩} ∈ V
75, 6unex 7788 . . 3 ({⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∪ {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩}) ∈ V
84, 7unex 7788 . 2 (({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) ∪ ({⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∪ {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩})) ∈ V
91, 8eqeltri 2860 1 ℂfld ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∈ wcel 2147  Vcvv 3454   ∪ cun 4152  {csn 4588  {ctp 4592  ⟨cop 4838   ∘ ccom 5660  ‘cfv 6561  (class class class)co 7446   ∈ cmpo 7448  ℂcc 11228   + caddc 11233   · cmul 11235   ≤ cle 11374   − cmin 11571  ∗ccj 15295  abscabs 15433  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-ext 2735  ax-sep 5253  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591  df-tp 4593  df-uni 4871  df-cnfld 21712
This theorem is used by:  regsumfsum  21774  rge0srg  21777  cnlmodlem3  25492  cnstrcvs  25495  cncvs  25499  cnncvsmulassdemo  25518  gsumzrsum  33702  xrge0iifmhm  34654  xrge0pluscn  34655  xrge0tmd  34660  cnzh  34683  esumpfinvallem  34789  aacllem  51251
  Copyright terms: Public domain W3C validator