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) Revise df-cnfld . (Revised by GG, 31-Mar-2025)

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 u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v
5 4 orci ⊢ Base ndx ℂ ∈ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∨ Base ndx ℂ ∈ * ndx *
6 elun ⊢ Base ndx ℂ ∈ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ↔ Base ndx ℂ ∈ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∨ Base ndx ℂ ∈ * ndx *
7 5 6 mpbir ⊢ Base ndx ℂ ∈ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx *
8 7 orci ⊢ Base ndx ℂ ∈ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * ndx * ∨ Base ndx ℂ ∈ TopSet ⁡ ndx MetOpen ⁡ abs ∘ − ≤ ndx ≤ dist ⁡ ndx abs ∘ − ∪ UnifSet ⁡ ndx metUnif ⁡ abs ∘ −
9 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 ∘ −
10 9 eleq2i ⊢ Base ndx ℂ ∈ ℂ fld ↔ Base ndx ℂ ∈ 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 ∘ −
11 elun ⊢ Base ndx ℂ ∈ 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 ℂ ∈ Base ndx ℂ + ndx u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * 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 u ∈ ℂ , v ∈ ℂ ⟼ u + v ⋅ ndx u ∈ ℂ , v ∈ ℂ ⟼ u ⁢ v ∪ * 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