Metamath Proof Explorer


Theorem cffldtocusgr

Description: The field of complex numbers can be made a complete simple graph with the set of pairs of complex numbers regarded as edges. This theorem demonstrates the capabilities of the current definitions for graphs applied to extensible structures. (Contributed by AV, 14-Nov-2021) (Proof shortened by AV, 17-Nov-2021)

Ref Expression
Hypotheses cffldtocusgr.p P = x 𝒫 | x = 2
cffldtocusgr.g G = fld sSet ef ndx I P
Assertion cffldtocusgr G ComplUSGraph

Proof

Step Hyp Ref Expression
1 cffldtocusgr.p P = x 𝒫 | x = 2
2 cffldtocusgr.g G = fld sSet ef ndx I P
3 opex Base ndx V
4 3 tpid1 Base ndx Base ndx + ndx + ndx ×
5 4 orci Base ndx Base ndx + ndx + ndx × Base ndx * ndx *
6 elun Base ndx Base ndx + ndx + ndx × * ndx * Base ndx Base ndx + ndx + ndx × Base ndx * ndx *
7 5 6 mpbir Base ndx Base ndx + ndx + ndx × * ndx *
8 7 orci Base ndx Base ndx + ndx + ndx × * ndx * Base ndx TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
9 df-cnfld fld = Base ndx + ndx + ndx × * ndx * TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
10 9 eleq2i Base ndx fld Base ndx Base ndx + ndx + ndx × * ndx * TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
11 elun Base ndx Base ndx + ndx + ndx × * ndx * TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs Base ndx Base ndx + ndx + ndx × * ndx * Base ndx TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
12 10 11 bitri Base ndx fld Base ndx Base ndx + ndx + ndx × * ndx * Base ndx TopSet ndx MetOpen abs ndx dist ndx abs UnifSet ndx metUnif abs
13 8 12 mpbir Base ndx fld
14 cnfldbas = Base fld
15 14 pweqi 𝒫 = 𝒫 Base fld
16 15 rabeqi x 𝒫 | x = 2 = x 𝒫 Base fld | x = 2
17 1 16 eqtri P = x 𝒫 Base fld | x = 2
18 cnfldstr fld Struct 1 13
19 18 a1i Base ndx fld fld Struct 1 13
20 fvex Base ndx V
21 cnex V
22 20 21 opeldm Base ndx fld Base ndx dom fld
23 17 19 2 22 structtocusgr Base ndx fld G ComplUSGraph
24 13 23 ax-mp G ComplUSGraph