Metamath Proof Explorer


Theorem cnfldaddOLD

Description: Obsolete version of cnfldadd as of 27-Apr-2025. (Contributed by Stefan O'Rear, 27-Nov-2014) (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 cnfldaddOLD + = + fld

Proof

Step Hyp Ref Expression
1 addex + V
2 cnfldstrOLD fld Struct 1 13
3 plusgid + 𝑔 = Slot + ndx
4 snsstp2 + ndx + Base ndx + ndx + ndx ×
5 ssun1 Base ndx + ndx + ndx × Base ndx + ndx + ndx × * ndx *
6 ssun1 Base ndx + ndx + ndx × * ndx * 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 Base ndx + ndx + ndx × * ndx * fld
9 5 8 sstri Base ndx + ndx + ndx × fld
10 4 9 sstri + ndx + fld
11 2 3 10 strfv + V + = + fld
12 1 11 ax-mp + = + fld