Metamath Proof Explorer


Theorem cnfldle

Description: The ordering of the field of complex numbers. Note that this is not actually an ordering on CC , but we put it in the structure anyway because restricting to RR does not affect this component, so that ` ( CCfld |``s RR ) is an ordered field even though CCfld ` itself is not. (Contributed by Mario Carneiro, 14-Aug-2015) (Revised by Mario Carneiro, 6-Oct-2015) (Revised by Thierry Arnoux, 17-Dec-2017)

Ref Expression
Assertion cnfldle = fld

Proof

Step Hyp Ref Expression
1 letsr TosetRel
2 cnfldstr fld Struct 1 13
3 pleid le = Slot ndx
4 snsstp2 ndx TopSet ndx MetOpen abs ndx dist ndx abs
5 ssun1 TopSet ndx MetOpen abs ndx dist ndx abs TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
6 ssun2 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
7 df-cnfld fld = Base ndx + ndx + ndx × * ndx * TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
8 6 7 sseqtrri TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs fld
9 5 8 sstri TopSet ndx MetOpen abs ndx dist ndx abs fld
10 4 9 sstri ndx fld
11 2 3 10 strfv TosetRel = fld
12 1 11 ax-mp = fld