Metamath Proof Explorer


Theorem cnfldstr

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 . (Revised by GG, 31-Mar-2025)

Ref Expression
Assertion cnfldstr ⊢ ℂ fld Struct 1 13

Proof

Step Hyp Ref Expression
1 df-cnfld ⊢ ℂ fld = Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∪ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ −
2 eqid ⊢ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * = Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx *
3 2 srngstr ⊢ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * Struct 1 4
4 9nn ⊢ 9 ∈ ℕ
5 tsetndx ⊢ TopSet ⁡ ndx = 9
6 9lt10 ⊢ 9 < 10
7 10nn ⊢ 10 ∈ ℕ
8 plendx ⊢ ≤ ndx = 10
9 1nn0 ⊢ 1 ∈ ℕ 0
10 0nn0 ⊢ 0 ∈ ℕ 0
11 2nn ⊢ 2 ∈ ℕ
12 2pos ⊢ 0 < 2
13 9 10 11 12 declt ⊢ 10 < 12
14 9 11 decnncl ⊢ 12 ∈ ℕ
15 dsndx ⊢ dist ⁡ ndx = 12
16 4 5 6 7 8 13 14 15 strle3 ⊢ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − Struct 9 12
17 3nn ⊢ 3 ∈ ℕ
18 9 17 decnncl ⊢ 13 ∈ ℕ
19 unifndx ⊢ UnifSet ⁡ ndx = 13
20 18 19 strle1 ⊢ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − Struct 13 13
21 2nn0 ⊢ 2 ∈ ℕ 0
22 2lt3 ⊢ 2 < 3
23 9 21 17 22 declt ⊢ 12 < 13
24 16 20 23 strleun ⊢ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − Struct 9 13
25 4lt9 ⊢ 4 < 9
26 3 24 25 strleun ⊢ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∪ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − Struct 1 13
27 1 26 eqbrtri ⊢ ℂ fld Struct 1 13