Theorem gg-dfcnfld 35474

Description: Alternative definition of the field of complex numbers. Equivalent to df-cnfld 21146. (Contributed by GG, 31-Mar-2025.)

Assertion

Ref	Expression
gg-dfcnfld	⊢ ℂfld = (({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) ∪ ({⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∪ {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩}))

Distinct variable group:   𝑥,𝑦

Proof of Theorem gg-dfcnfld

Step	Hyp	Ref	Expression
1		df-cnfld 21146	. 2 ⊢ ℂfld = (({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) ∪ ({⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∪ {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩}))
2		eqidd 2732	. . . . . 6 ⊢ (⊤ → ⟨(Base‘ndx), ℂ⟩ = ⟨(Base‘ndx), ℂ⟩)
3		ax-addf 11192	. . . . . . . . . 10 ⊢ + :(ℂ × ℂ)⟶ℂ
4		ffn 6718	. . . . . . . . . 10 ⊢ ( + :(ℂ × ℂ)⟶ℂ → + Fn (ℂ × ℂ))
5	3, 4	ax-mp 5	. . . . . . . . 9 ⊢ + Fn (ℂ × ℂ)
6		fnov 7543	. . . . . . . . 9 ⊢ ( + Fn (ℂ × ℂ) ↔ + = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)))
7	5, 6	mpbi 229	. . . . . . . 8 ⊢ + = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))
8	7	opeq2i 4878	. . . . . . 7 ⊢ ⟨(+g‘ndx), + ⟩ = ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩
9	8	a1i 11	. . . . . 6 ⊢ (⊤ → ⟨(+g‘ndx), + ⟩ = ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩)
10		ax-mulf 11193	. . . . . . . . . 10 ⊢ · :(ℂ × ℂ)⟶ℂ
11		ffn 6718	. . . . . . . . . 10 ⊢ ( · :(ℂ × ℂ)⟶ℂ → · Fn (ℂ × ℂ))
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ · Fn (ℂ × ℂ)
13		fnov 7543	. . . . . . . . 9 ⊢ ( · Fn (ℂ × ℂ) ↔ · = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)))
14	12, 13	mpbi 229	. . . . . . . 8 ⊢ · = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))
15	14	opeq2i 4878	. . . . . . 7 ⊢ ⟨(.r‘ndx), · ⟩ = ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩
16	15	a1i 11	. . . . . 6 ⊢ (⊤ → ⟨(.r‘ndx), · ⟩ = ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩)
17	2, 9, 16	tpeq123d 4753	. . . . 5 ⊢ (⊤ → {⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} = {⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩})
18	17	mptru 1547	. . . 4 ⊢ {⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} = {⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩}
19	18	uneq1i 4160	. . 3 ⊢ ({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) = ({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩})
20	19	uneq1i 4160	. 2 ⊢ (({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), · ⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) ∪ ({⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∪ {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩})) = (({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) ∪ ({⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∪ {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩}))
21	1, 20	eqtri 2759	1 ⊢ ℂfld = (({⟨(Base‘ndx), ℂ⟩, ⟨(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))⟩} ∪ {⟨(*𝑟‘ndx), ∗⟩}) ∪ ({⟨(TopSet‘ndx), (MetOpen‘(abs ∘ − ))⟩, ⟨(le‘ndx), ≤ ⟩, ⟨(dist‘ndx), (abs ∘ − )⟩} ∪ {⟨(UnifSet‘ndx), (metUnif‘(abs ∘ − ))⟩}))

Syntax hints:   = wceq 1540  ⊤wtru 1541   ∪ cun 3947  {csn 4629  {ctp 4633  ⟨cop 4635   × cxp 5675   ∘ ccom 5681   Fn wfn 6539  ⟶wf 6540  ‘cfv 6544  (class class class)co 7412   ∈ cmpo 7414  ℂcc 11111   + caddc 11116   · cmul 11118   ≤ cle 11254   − cmin 11449  ∗ccj 15048  abscabs 15186  ndxcnx 17131  Basecbs 17149  +_gcplusg 17202  ._rcmulr 17203  *_𝑟cstv 17204  TopSetcts 17208  lecple 17209  distcds 17211  UnifSetcunif 17212  MetOpencmopn 21135  metUnifcmetu 21136  ℂ_fldccnfld 21145

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-addf 11192  ax-mulf 11193

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-tp 4634  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-fv 6552  df-ov 7415  df-oprab 7416  df-mpo 7417  df-cnfld 21146

This theorem is referenced by:  gg-cnfldstr  35475  gg-cnfldbas  35476  mpocnfldadd  35477  mpocnfldmul  35478  gg-cnfldcj  35479  gg-cnfldtset  35480  gg-cnfldle  35481  gg-cnfldds  35482  gg-cnfldunif  35483  gg-cnfldfun  35484  gg-cnfldfunALT  35485  gg-cffldtocusgr  35486