Metamath Proof Explorer


Theorem cnfldtsetOLD

Description: Obsolete version of cnfldtset as of 27-Apr-2025. (Contributed by Mario Carneiro, 14-Aug-2015) (Revised by Mario Carneiro, 6-Oct-2015) (Revised by Thierry Arnoux, 17-Dec-2017) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion cnfldtsetOLD MetOpen abs = TopSet fld

Proof

Step Hyp Ref Expression
1 fvex MetOpen abs V
2 cnfldstrOLD fld Struct 1 13
3 tsetid TopSet = Slot TopSet ndx
4 snsstp1 TopSet ndx MetOpen abs 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 dfcnfldOLD 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 TopSet ndx MetOpen abs fld
11 2 3 10 strfv MetOpen abs V MetOpen abs = TopSet fld
12 1 11 ax-mp MetOpen abs = TopSet fld