Metamath Proof Explorer


Theorem cnfldfunALT

Description: The field of complex numbers is a function. Alternate proof of cnfldfun not requiring that the index set of the components is ordered, but using quadratically many inequalities for the indices. (Contributed by AV, 14-Nov-2021) (Proof shortened by AV, 11-Nov-2024) Revise df-cnfld . (Revised by GG, 31-Mar-2025) Revise df-cnfld . (Revised by Thierry Arnoux, 9-Nov-2026) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion cnfldfunALT ⊢ Fun ⁡ ℂ fld

Proof

Step Hyp Ref Expression
1 basendxnplusgndx ⊢ Base ndx ≠ + ndx
2 basendxnmulrndx ⊢ Base ndx ≠ ⋅ ndx
3 plusgndxnmulrndx ⊢ + ndx ≠ ⋅ ndx
4 fvex ⊢ Base ndx ∈ V
5 fvex ⊢ + ndx ∈ V
6 fvex ⊢ ⋅ ndx ∈ V
7 cnex ⊢ ℂ ∈ V
8 mpoaddex ⊢ u ∈ ℂ , v ∈ ℂ ⟼ u + v ∈ V
9 mpomulex ⊢ u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∈ V
10 4 5 6 7 8 9 funtp ⊢ Base ndx ≠ + ndx ∧ Base ndx ≠ ⋅ ndx ∧ + ndx ≠ ⋅ ndx → Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v
11 1 2 3 10 mp3an ⊢ Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v
12 fvex ⊢ * ndx ∈ V
13 cjf ⊢ * : ℂ ⟶ ℂ
14 fex ⊢ * : ℂ ⟶ ℂ ∧ ℂ ∈ V → * ∈ V
15 13 7 14 mp2an ⊢ * ∈ V
16 12 15 funsn ⊢ Fun ⁡ * ndx *
17 11 16 pm3.2i ⊢ Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∧ Fun ⁡ * ndx *
18 7 8 9 dmtpop ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v = Base ndx + ndx ⋅ ndx
19 15 dmsnop ⊢ dom ⁡ * ndx * = * ndx
20 18 19 ineq12i ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ * ndx * = Base ndx + ndx ⋅ ndx ∩ * ndx
21 starvndxnbasendx ⊢ * ndx ≠ Base ndx
22 21 necomi ⊢ Base ndx ≠ * ndx
23 starvndxnplusgndx ⊢ * ndx ≠ + ndx
24 23 necomi ⊢ + ndx ≠ * ndx
25 starvndxnmulrndx ⊢ * ndx ≠ ⋅ ndx
26 25 necomi ⊢ ⋅ ndx ≠ * ndx
27 disjtpsn ⊢ Base ndx ≠ * ndx ∧ + ndx ≠ * ndx ∧ ⋅ ndx ≠ * ndx → Base ndx + ndx ⋅ ndx ∩ * ndx = ∅
28 22 24 26 27 mp3an ⊢ Base ndx + ndx ⋅ ndx ∩ * ndx = ∅
29 20 28 eqtri ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ * ndx * = ∅
30 funun ⊢ Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∧ Fun ⁡ * ndx * ∧ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ * ndx * = ∅ → Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx *
31 17 29 30 mp2an ⊢ Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx *
32 slotsdifplendx ⊢ * ndx ≠ ≤ ndx ∧ TopSet ⁡ ndx ≠ ≤ ndx
33 32 simpri ⊢ TopSet ⁡ ndx ≠ ≤ ndx
34 dsndxntsetndx ⊢ dist ⁡ ndx ≠ TopSet ⁡ ndx
35 34 necomi ⊢ TopSet ⁡ ndx ≠ dist ⁡ ndx
36 slotsdifdsndx ⊢ * ndx ≠ dist ⁡ ndx ∧ ≤ ndx ≠ dist ⁡ ndx
37 36 simpri ⊢ ≤ ndx ≠ dist ⁡ ndx
38 fvex ⊢ TopSet ⁡ ndx ∈ V
39 fvex ⊢ ≤ ndx ∈ V
40 fvex ⊢ dist ⁡ ndx ∈ V
41 fvex ⊢ MetOpen ⁡ abs ∘ − ∈ V
42 letsr ⊢ ≤ ∈ TosetRel
43 42 elexi ⊢ ≤ ∈ V
44 absf ⊢ abs : ℂ ⟶ ℝ
45 fex ⊢ abs : ℂ ⟶ ℝ ∧ ℂ ∈ V → abs ∈ V
46 44 7 45 mp2an ⊢ abs ∈ V
47 subf ⊢ − : ℂ × ℂ ⟶ ℂ
48 7 7 xpex ⊢ ℂ × ℂ ∈ V
49 fex ⊢ − : ℂ × ℂ ⟶ ℂ ∧ ℂ × ℂ ∈ V → − ∈ V
50 47 48 49 mp2an ⊢ − ∈ V
51 46 50 coex ⊢ abs ∘ − ∈ V
52 38 39 40 41 43 51 funtp ⊢ TopSet ⁡ ndx ≠ ≤ ndx ∧ TopSet ⁡ ndx ≠ dist ⁡ ndx ∧ ≤ ndx ≠ dist ⁡ ndx → Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ −
53 33 35 37 52 mp3an ⊢ Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ −
54 unifndx ⊢ UnifSet ⁡ ndx = 13
55 1nn0 ⊢ 1 ∈ ℕ 0
56 3nn0 ⊢ 3 ∈ ℕ 0
57 55 56 deccl ⊢ 13 ∈ ℕ 0
58 57 nn0rei ⊢ 13 ∈ ℝ
59 54 58 eqeltri ⊢ UnifSet ⁡ ndx ∈ ℝ
60 2nn0 ⊢ 2 ∈ ℕ 0
61 3lt10 ⊢ 3 < 10
62 1lt2 ⊢ 1 < 2
63 55 60 56 55 61 62 decltc ⊢ 13 < 21
64 eufndx ⊢ EuclF ⁡ ndx = 21
65 63 64 breqtrri ⊢ 13 < EuclF ⁡ ndx
66 54 65 eqbrtri ⊢ UnifSet ⁡ ndx < EuclF ⁡ ndx
67 59 66 ltneii ⊢ UnifSet ⁡ ndx ≠ EuclF ⁡ ndx
68 fvex ⊢ UnifSet ⁡ ndx ∈ V
69 fvex ⊢ EuclF ⁡ ndx ∈ V
70 fvex ⊢ metUnif ⁡ abs ∘ − ∈ V
71 68 69 70 46 funpr ⊢ UnifSet ⁡ ndx ≠ EuclF ⁡ ndx → Fun ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
72 67 71 ax-mp ⊢ Fun ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
73 53 72 pm3.2i ⊢ Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∧ Fun ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
74 41 43 51 dmtpop ⊢ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = TopSet ⁡ ndx ≤ ndx dist ⁡ ndx
75 70 46 dmprop ⊢ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = UnifSet ⁡ ndx EuclF ⁡ ndx
76 74 75 ineq12i ⊢ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = TopSet ⁡ ndx ≤ ndx dist ⁡ ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx
77 slotsdifunifndx ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx
78 unifndxntsetndx ⊢ UnifSet ⁡ ndx ≠ TopSet ⁡ ndx
79 78 necomi ⊢ TopSet ⁡ ndx ≠ UnifSet ⁡ ndx
80 79 a1i ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx → TopSet ⁡ ndx ≠ UnifSet ⁡ ndx
81 80 anim1i ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx → TopSet ⁡ ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx
82 3anass ⊢ TopSet ⁡ ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx ↔ TopSet ⁡ ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx
83 81 82 sylibr ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx → TopSet ⁡ ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx
84 77 83 ax-mp ⊢ TopSet ⁡ ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx
85 tsetndx ⊢ TopSet ⁡ ndx = 9
86 9nn0 ⊢ 9 ∈ ℕ 0
87 85 86 eqeltri ⊢ TopSet ⁡ ndx ∈ ℕ 0
88 87 nn0rei ⊢ TopSet ⁡ ndx ∈ ℝ
89 2nn ⊢ 2 ∈ ℕ
90 9lt10 ⊢ 9 < 10
91 89 55 86 90 declti ⊢ 9 < 21
92 91 64 breqtrri ⊢ 9 < EuclF ⁡ ndx
93 85 92 eqbrtri ⊢ TopSet ⁡ ndx < EuclF ⁡ ndx
94 88 93 ltneii ⊢ TopSet ⁡ ndx ≠ EuclF ⁡ ndx
95 plendx ⊢ ≤ ndx = 10
96 10nn0 ⊢ 10 ∈ ℕ 0
97 95 96 eqeltri ⊢ ≤ ndx ∈ ℕ 0
98 97 nn0rei ⊢ ≤ ndx ∈ ℝ
99 0nn0 ⊢ 0 ∈ ℕ 0
100 10pos ⊢ 0 < 10
101 55 60 99 55 100 62 decltc ⊢ 10 < 21
102 101 64 breqtrri ⊢ 10 < EuclF ⁡ ndx
103 95 102 eqbrtri ⊢ ≤ ndx < EuclF ⁡ ndx
104 98 103 ltneii ⊢ ≤ ndx ≠ EuclF ⁡ ndx
105 dsndx ⊢ dist ⁡ ndx = 12
106 55 60 deccl ⊢ 12 ∈ ℕ 0
107 106 nn0rei ⊢ 12 ∈ ℝ
108 105 107 eqeltri ⊢ dist ⁡ ndx ∈ ℝ
109 2lt10 ⊢ 2 < 10
110 55 60 60 55 109 62 decltc ⊢ 12 < 21
111 110 64 breqtrri ⊢ 12 < EuclF ⁡ ndx
112 105 111 eqbrtri ⊢ dist ⁡ ndx < EuclF ⁡ ndx
113 108 112 ltneii ⊢ dist ⁡ ndx ≠ EuclF ⁡ ndx
114 94 104 113 3pm3.2i ⊢ TopSet ⁡ ndx ≠ EuclF ⁡ ndx ∧ ≤ ndx ≠ EuclF ⁡ ndx ∧ dist ⁡ ndx ≠ EuclF ⁡ ndx
115 disjtppr ⊢ TopSet ⁡ ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx ∧ TopSet ⁡ ndx ≠ EuclF ⁡ ndx ∧ ≤ ndx ≠ EuclF ⁡ ndx ∧ dist ⁡ ndx ≠ EuclF ⁡ ndx → TopSet ⁡ ndx ≤ ndx dist ⁡ ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx = ∅
116 84 114 115 mp2an ⊢ TopSet ⁡ ndx ≤ ndx dist ⁡ ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx = ∅
117 76 116 eqtri ⊢ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
118 funun ⊢ Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∧ Fun ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs ∧ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅ → Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
119 73 117 118 mp2an ⊢ Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
120 31 119 pm3.2i ⊢ Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∧ Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
121 dmun ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * = dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ dom ⁡ * ndx *
122 dmun ⊢ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
123 121 122 ineq12i ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs
124 18 74 ineq12i ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = Base ndx + ndx ⋅ ndx ∩ TopSet ⁡ ndx ≤ ndx dist ⁡ ndx
125 tsetndxnbasendx ⊢ TopSet ⁡ ndx ≠ Base ndx
126 125 necomi ⊢ Base ndx ≠ TopSet ⁡ ndx
127 tsetndxnplusgndx ⊢ TopSet ⁡ ndx ≠ + ndx
128 127 necomi ⊢ + ndx ≠ TopSet ⁡ ndx
129 tsetndxnmulrndx ⊢ TopSet ⁡ ndx ≠ ⋅ ndx
130 129 necomi ⊢ ⋅ ndx ≠ TopSet ⁡ ndx
131 126 128 130 3pm3.2i ⊢ Base ndx ≠ TopSet ⁡ ndx ∧ + ndx ≠ TopSet ⁡ ndx ∧ ⋅ ndx ≠ TopSet ⁡ ndx
132 plendxnbasendx ⊢ ≤ ndx ≠ Base ndx
133 132 necomi ⊢ Base ndx ≠ ≤ ndx
134 plendxnplusgndx ⊢ ≤ ndx ≠ + ndx
135 134 necomi ⊢ + ndx ≠ ≤ ndx
136 plendxnmulrndx ⊢ ≤ ndx ≠ ⋅ ndx
137 136 necomi ⊢ ⋅ ndx ≠ ≤ ndx
138 133 135 137 3pm3.2i ⊢ Base ndx ≠ ≤ ndx ∧ + ndx ≠ ≤ ndx ∧ ⋅ ndx ≠ ≤ ndx
139 dsndxnbasendx ⊢ dist ⁡ ndx ≠ Base ndx
140 139 necomi ⊢ Base ndx ≠ dist ⁡ ndx
141 dsndxnplusgndx ⊢ dist ⁡ ndx ≠ + ndx
142 141 necomi ⊢ + ndx ≠ dist ⁡ ndx
143 dsndxnmulrndx ⊢ dist ⁡ ndx ≠ ⋅ ndx
144 143 necomi ⊢ ⋅ ndx ≠ dist ⁡ ndx
145 140 142 144 3pm3.2i ⊢ Base ndx ≠ dist ⁡ ndx ∧ + ndx ≠ dist ⁡ ndx ∧ ⋅ ndx ≠ dist ⁡ ndx
146 disjtp2 ⊢ Base ndx ≠ TopSet ⁡ ndx ∧ + ndx ≠ TopSet ⁡ ndx ∧ ⋅ ndx ≠ TopSet ⁡ ndx ∧ Base ndx ≠ ≤ ndx ∧ + ndx ≠ ≤ ndx ∧ ⋅ ndx ≠ ≤ ndx ∧ Base ndx ≠ dist ⁡ ndx ∧ + ndx ≠ dist ⁡ ndx ∧ ⋅ ndx ≠ dist ⁡ ndx → Base ndx + ndx ⋅ ndx ∩ TopSet ⁡ ndx ≤ ndx dist ⁡ ndx = ∅
147 131 138 145 146 mp3an ⊢ Base ndx + ndx ⋅ ndx ∩ TopSet ⁡ ndx ≤ ndx dist ⁡ ndx = ∅
148 124 147 eqtri ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = ∅
149 18 75 ineq12i ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = Base ndx + ndx ⋅ ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx
150 unifndxnbasendx ⊢ UnifSet ⁡ ndx ≠ Base ndx
151 150 necomi ⊢ Base ndx ≠ UnifSet ⁡ ndx
152 151 a1i ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx → Base ndx ≠ UnifSet ⁡ ndx
153 3simpa ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx → + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx
154 3anass ⊢ Base ndx ≠ UnifSet ⁡ ndx ∧ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ↔ Base ndx ≠ UnifSet ⁡ ndx ∧ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx
155 152 153 154 sylanbrc ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx → Base ndx ≠ UnifSet ⁡ ndx ∧ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx
156 155 adantr ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx → Base ndx ≠ UnifSet ⁡ ndx ∧ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx
157 77 156 ax-mp ⊢ Base ndx ≠ UnifSet ⁡ ndx ∧ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx
158 basendx ⊢ Base ndx = 1
159 158 55 eqeltri ⊢ Base ndx ∈ ℕ 0
160 159 nn0rei ⊢ Base ndx ∈ ℝ
161 1lt10 ⊢ 1 < 10
162 89 55 55 161 declti ⊢ 1 < 21
163 162 64 breqtrri ⊢ 1 < EuclF ⁡ ndx
164 158 163 eqbrtri ⊢ Base ndx < EuclF ⁡ ndx
165 160 164 ltneii ⊢ Base ndx ≠ EuclF ⁡ ndx
166 plusgndx ⊢ + ndx = 2
167 166 60 eqeltri ⊢ + ndx ∈ ℕ 0
168 167 nn0rei ⊢ + ndx ∈ ℝ
169 89 55 60 109 declti ⊢ 2 < 21
170 169 64 breqtrri ⊢ 2 < EuclF ⁡ ndx
171 166 170 eqbrtri ⊢ + ndx < EuclF ⁡ ndx
172 168 171 ltneii ⊢ + ndx ≠ EuclF ⁡ ndx
173 mulrndx ⊢ ⋅ ndx = 3
174 173 56 eqeltri ⊢ ⋅ ndx ∈ ℕ 0
175 174 nn0rei ⊢ ⋅ ndx ∈ ℝ
176 89 55 56 61 declti ⊢ 3 < 21
177 176 64 breqtrri ⊢ 3 < EuclF ⁡ ndx
178 173 177 eqbrtri ⊢ ⋅ ndx < EuclF ⁡ ndx
179 175 178 ltneii ⊢ ⋅ ndx ≠ EuclF ⁡ ndx
180 165 172 179 3pm3.2i ⊢ Base ndx ≠ EuclF ⁡ ndx ∧ + ndx ≠ EuclF ⁡ ndx ∧ ⋅ ndx ≠ EuclF ⁡ ndx
181 disjtppr ⊢ Base ndx ≠ UnifSet ⁡ ndx ∧ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ Base ndx ≠ EuclF ⁡ ndx ∧ + ndx ≠ EuclF ⁡ ndx ∧ ⋅ ndx ≠ EuclF ⁡ ndx → Base ndx + ndx ⋅ ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx = ∅
182 157 180 181 mp2an ⊢ Base ndx + ndx ⋅ ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx = ∅
183 149 182 eqtri ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
184 148 183 pm3.2i ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = ∅ ∧ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
185 undisj2 ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = ∅ ∧ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅ ↔ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
186 184 185 mpbi ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
187 19 74 ineq12i ⊢ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = * ndx ∩ TopSet ⁡ ndx ≤ ndx dist ⁡ ndx
188 tsetndxnstarvndx ⊢ TopSet ⁡ ndx ≠ * ndx
189 necom ⊢ * ndx ≠ ≤ ndx ↔ ≤ ndx ≠ * ndx
190 189 birani ⊢ * ndx ≠ ≤ ndx ∧ TopSet ⁡ ndx ≠ ≤ ndx → ≤ ndx ≠ * ndx
191 32 190 ax-mp ⊢ ≤ ndx ≠ * ndx
192 necom ⊢ * ndx ≠ dist ⁡ ndx ↔ dist ⁡ ndx ≠ * ndx
193 192 birani ⊢ * ndx ≠ dist ⁡ ndx ∧ ≤ ndx ≠ dist ⁡ ndx → dist ⁡ ndx ≠ * ndx
194 36 193 ax-mp ⊢ dist ⁡ ndx ≠ * ndx
195 disjtpsn ⊢ TopSet ⁡ ndx ≠ * ndx ∧ ≤ ndx ≠ * ndx ∧ dist ⁡ ndx ≠ * ndx → TopSet ⁡ ndx ≤ ndx dist ⁡ ndx ∩ * ndx = ∅
196 188 191 194 195 mp3an ⊢ TopSet ⁡ ndx ≤ ndx dist ⁡ ndx ∩ * ndx = ∅
197 196 ineqcomi ⊢ * ndx ∩ TopSet ⁡ ndx ≤ ndx dist ⁡ ndx = ∅
198 187 197 eqtri ⊢ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = ∅
199 19 75 ineq12i ⊢ dom ⁡ * ndx * ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = * ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx
200 incom ⊢ * ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx = UnifSet ⁡ ndx EuclF ⁡ ndx ∩ * ndx
201 simpl3 ⊢ + ndx ≠ UnifSet ⁡ ndx ∧ ⋅ ndx ≠ UnifSet ⁡ ndx ∧ * ndx ≠ UnifSet ⁡ ndx ∧ ≤ ndx ≠ UnifSet ⁡ ndx ∧ dist ⁡ ndx ≠ UnifSet ⁡ ndx → * ndx ≠ UnifSet ⁡ ndx
202 77 201 ax-mp ⊢ * ndx ≠ UnifSet ⁡ ndx
203 202 necomi ⊢ UnifSet ⁡ ndx ≠ * ndx
204 starvndx ⊢ * ndx = 4
205 4nn0 ⊢ 4 ∈ ℕ 0
206 204 205 eqeltri ⊢ * ndx ∈ ℕ 0
207 206 nn0rei ⊢ * ndx ∈ ℝ
208 4lt10 ⊢ 4 < 10
209 89 55 205 208 declti ⊢ 4 < 21
210 209 64 breqtrri ⊢ 4 < EuclF ⁡ ndx
211 204 210 eqbrtri ⊢ * ndx < EuclF ⁡ ndx
212 207 211 gtneii ⊢ EuclF ⁡ ndx ≠ * ndx
213 disjprsn ⊢ UnifSet ⁡ ndx ≠ * ndx ∧ EuclF ⁡ ndx ≠ * ndx → UnifSet ⁡ ndx EuclF ⁡ ndx ∩ * ndx = ∅
214 203 212 213 mp2an ⊢ UnifSet ⁡ ndx EuclF ⁡ ndx ∩ * ndx = ∅
215 200 214 eqtri ⊢ * ndx ∩ UnifSet ⁡ ndx EuclF ⁡ ndx = ∅
216 199 215 eqtri ⊢ dom ⁡ * ndx * ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
217 198 216 pm3.2i ⊢ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = ∅ ∧ dom ⁡ * ndx * ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
218 undisj2 ⊢ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − = ∅ ∧ dom ⁡ * ndx * ∩ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅ ↔ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
219 217 218 mpbi ⊢ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
220 186 219 pm3.2i ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅ ∧ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
221 undisj1 ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅ ∧ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅ ↔ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
222 220 221 mpbi ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ dom ⁡ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ dom ⁡ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
223 123 222 eqtri ⊢ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅
224 funun ⊢ Fun ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∧ Fun ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs ∧ dom ⁡ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∩ dom ⁡ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ − EuclF ⁡ ndx abs = ∅ → Fun ⁡ 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 ∘ − EuclF ⁡ ndx abs
225 120 223 224 mp2an ⊢ Fun ⁡ 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 ∘ − EuclF ⁡ ndx abs
226 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 ∘ − EuclF ⁡ ndx abs
227 226 funeqi ⊢ Fun ⁡ ℂ fld ↔ Fun ⁡ 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 ∘ − EuclF ⁡ ndx abs
228 225 227 mpbir ⊢ Fun ⁡ ℂ fld