Metamath Proof Explorer


Theorem dfcnfldOLD

Description: Obsolete version of df-cnfld as of 27-Apr-2025. (Contributed by Stefan O'Rear, 27-Nov-2014) (Revised by Thierry Arnoux, 15-Dec-2017) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion dfcnfldOLD fld = Base ndx + ndx + ndx × * ndx * TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs

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 eqidd Base ndx = Base ndx
3 ax-addf + : ×
4 ffn + : × + Fn ×
5 3 4 ax-mp + Fn ×
6 fnov + Fn × + = u , v u + v
7 5 6 mpbi + = u , v u + v
8 eqcom + = u , v u + v u , v u + v = +
9 7 8 mpbi u , v u + v = +
10 9 opeq2i + ndx u , v u + v = + ndx +
11 10 a1i + ndx u , v u + v = + ndx +
12 ax-mulf × : ×
13 ffn × : × × Fn ×
14 12 13 ax-mp × Fn ×
15 fnov × Fn × × = u , v u v
16 14 15 mpbi × = u , v u v
17 eqcom × = u , v u v u , v u v = ×
18 16 17 mpbi u , v u v = ×
19 18 opeq2i ndx u , v u v = ndx ×
20 19 a1i ndx u , v u v = ndx ×
21 2 11 20 tpeq123d Base ndx + ndx u , v u + v ndx u , v u v = Base ndx + ndx + ndx ×
22 21 mptru Base ndx + ndx u , v u + v ndx u , v u v = Base ndx + ndx + ndx ×
23 22 uneq1i Base ndx + ndx u , v u + v ndx u , v u v * ndx * = Base ndx + ndx + ndx × * ndx *
24 23 uneq1i 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 = Base ndx + ndx + ndx × * ndx * TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
25 1 24 eqtri fld = Base ndx + ndx + ndx × * ndx * TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs