| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cffldtocusgr | Structured version Visualization version GIF version | ||
| 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 21684. (Revised by GG, 31-Mar-2025.) |
| Ref | Expression |
|---|---|
| cffldtocusgr.p | ⊢ 𝑃 = {𝑥 ∈ 𝒫 ℂ ∣ (♯‘𝑥) = 2} |
| cffldtocusgr.g | ⊢ 𝐺 = (ℂfld sSet 〈(.ef‘ndx), ( I ↾ 𝑃)〉) |
| Ref | Expression |
|---|---|
| cffldtocusgr | ⊢ 𝐺 ∈ ComplUSGraph |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opex 5431 | . . . . . . 7 ⊢ 〈(Base‘ndx), ℂ〉 ∈ V | |
| 2 | 1 | tpid1 4725 | . . . . . 6 ⊢ 〈(Base‘ndx), ℂ〉 ∈ {〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} |
| 3 | 2 | orci 879 | . . . . 5 ⊢ (〈(Base‘ndx), ℂ〉 ∈ {〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∨ 〈(Base‘ndx), ℂ〉 ∈ {〈(*𝑟‘ndx), ∗〉}) |
| 4 | elun 4152 | . . . . 5 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ↔ (〈(Base‘ndx), ℂ〉 ∈ {〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∨ 〈(Base‘ndx), ℂ〉 ∈ {〈(*𝑟‘ndx), ∗〉})) | |
| 5 | 3, 4 | mpbir 234 | . . . 4 ⊢ 〈(Base‘ndx), ℂ〉 ∈ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) |
| 6 | 5 | orci 879 | . . 3 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∨ 〈(Base‘ndx), ℂ〉 ∈ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) |
| 7 | df-cnfld 21684 | . . . . 5 ⊢ ℂfld = (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) | |
| 8 | 7 | eleq2i 2852 | . . . 4 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ℂfld ↔ 〈(Base‘ndx), ℂ〉 ∈ (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉}))) |
| 9 | elun 4152 | . . . 4 ⊢ (〈(Base‘ndx), ℂ〉 ∈ (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) ↔ (〈(Base‘ndx), ℂ〉 ∈ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∨ 〈(Base‘ndx), ℂ〉 ∈ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉}))) | |
| 10 | 8, 9 | bitri 278 | . . 3 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ℂfld ↔ (〈(Base‘ndx), ℂ〉 ∈ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 + 𝑣))〉, 〈(.r‘ndx), (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∨ 〈(Base‘ndx), ℂ〉 ∈ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉}))) |
| 11 | 6, 10 | mpbir 234 | . 2 ⊢ 〈(Base‘ndx), ℂ〉 ∈ ℂfld |
| 12 | cffldtocusgr.p | . . . 4 ⊢ 𝑃 = {𝑥 ∈ 𝒫 ℂ ∣ (♯‘𝑥) = 2} | |
| 13 | cnfldbas 21687 | . . . . . 6 ⊢ ℂ = (Base‘ℂfld) | |
| 14 | 13 | pweqi 4572 | . . . . 5 ⊢ 𝒫 ℂ = 𝒫 (Base‘ℂfld) |
| 15 | 14 | rabeqi 3425 | . . . 4 ⊢ {𝑥 ∈ 𝒫 ℂ ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 (Base‘ℂfld) ∣ (♯‘𝑥) = 2} |
| 16 | 12, 15 | eqtri 2783 | . . 3 ⊢ 𝑃 = {𝑥 ∈ 𝒫 (Base‘ℂfld) ∣ (♯‘𝑥) = 2} |
| 17 | cnfldstr 21685 | . . . 4 ⊢ ℂfld Struct 〈1, ;13〉 | |
| 18 | 17 | a1i 11 | . . 3 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ℂfld → ℂfld Struct 〈1, ;13〉) |
| 19 | cffldtocusgr.g | . . 3 ⊢ 𝐺 = (ℂfld sSet 〈(.ef‘ndx), ( I ↾ 𝑃)〉) | |
| 20 | fvex 6898 | . . . 4 ⊢ (Base‘ndx) ∈ V | |
| 21 | cnex 11284 | . . . 4 ⊢ ℂ ∈ V | |
| 22 | 20, 21 | opeldm 5888 | . . 3 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ℂfld → (Base‘ndx) ∈ dom ℂfld) |
| 23 | 16, 18, 19, 22 | structtocusgr 30032 | . 2 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ℂfld → 𝐺 ∈ ComplUSGraph) |
| 24 | 11, 23 | ax-mp 5 | 1 ⊢ 𝐺 ∈ ComplUSGraph |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∨ wo 861 = wceq 1569 ∈ wcel 2144 {crab 3412 ∪ cun 4149 𝒫 cpw 4556 {csn 4584 {ctp 4588 〈cop 4834 class class class wbr 5102 I cid 5544 ↾ cres 5652 ∘ ccom 5654 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 ℂcc 11201 1c1 11204 + caddc 11206 · cmul 11208 ≤ cle 11347 − cmin 11544 2c2 12400 3c3 12401 ;cdc 12817 ♯chash 14477 ∗ccj 15268 abscabs 15406 Struct cstr 17329 sSet csts 17346 ndxcnx 17376 Basecbs 17392 +gcplusg 17433 .rcmulr 17434 *𝑟cstv 17435 TopSetcts 17439 lecple 17440 distcds 17442 UnifSetcunif 17443 MetOpencmopn 21673 metUnifcmetu 21674 ℂfldccnfld 21683 .efcedgf 29571 ComplUSGraphccusgr 29996 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-oadd 8483 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-dju 9985 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-2 12408 df-3 12409 df-4 12410 df-5 12411 df-6 12412 df-7 12413 df-8 12414 df-9 12415 df-n0 12610 df-xnn0 12683 df-z 12697 df-dec 12818 df-uz 12969 df-fz 13643 df-hash 14478 df-struct 17330 df-sets 17347 df-slot 17365 df-ndx 17377 df-base 17393 df-plusg 17446 df-mulr 17447 df-starv 17448 df-tset 17452 df-ple 17453 df-ds 17455 df-unif 17456 df-cnfld 21684 df-edgf 29572 df-vtx 29581 df-iedg 29582 df-edg 29631 df-usgr 29737 df-nbgr 29919 df-uvtx 29972 df-cplgr 29997 df-cusgr 29998 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |