| 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 21709. (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 5436 | . . . . . . 7 ⊢ 〈(Base‘ndx), ℂ〉 ∈ V | |
| 2 | 1 | tpid1 4729 | . . . . . 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 4155 | . . . . 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 21709 | . . . . 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 2856 | . . . 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 4155 | . . . 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 21712 | . . . . . 6 ⊢ ℂ = (Base‘ℂfld) | |
| 14 | 13 | pweqi 4576 | . . . . 5 ⊢ 𝒫 ℂ = 𝒫 (Base‘ℂfld) |
| 15 | 14 | rabeqi 3429 | . . . 4 ⊢ {𝑥 ∈ 𝒫 ℂ ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 (Base‘ℂfld) ∣ (♯‘𝑥) = 2} |
| 16 | 12, 15 | eqtri 2786 | . . 3 ⊢ 𝑃 = {𝑥 ∈ 𝒫 (Base‘ℂfld) ∣ (♯‘𝑥) = 2} |
| 17 | cnfldstr 21710 | . . . 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 6921 | . . . 4 ⊢ (Base‘ndx) ∈ V | |
| 21 | cnex 11308 | . . . 4 ⊢ ℂ ∈ V | |
| 22 | 20, 21 | opeldm 5896 | . . 3 ⊢ (〈(Base‘ndx), ℂ〉 ∈ ℂfld → (Base‘ndx) ∈ dom ℂfld) |
| 23 | 16, 18, 19, 22 | structtocusgr 30057 | . 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 1570 ∈ wcel 2147 {crab 3416 ∪ cun 4152 𝒫 cpw 4560 {csn 4588 {ctp 4592 〈cop 4838 class class class wbr 5106 I cid 5549 ↾ cres 5657 ∘ ccom 5659 ‘cfv 6558 (class class class)co 7443 ∈ cmpo 7445 ℂcc 11225 1c1 11228 + caddc 11230 · cmul 11232 ≤ cle 11371 − cmin 11568 2c2 12424 3c3 12425 ;cdc 12841 ♯chash 14501 ∗ccj 15292 abscabs 15430 Struct cstr 17353 sSet csts 17370 ndxcnx 17400 Basecbs 17416 +gcplusg 17457 .rcmulr 17458 *𝑟cstv 17459 TopSetcts 17463 lecple 17464 distcds 17466 UnifSetcunif 17467 MetOpencmopn 21698 metUnifcmetu 21699 ℂfldccnfld 21708 .efcedgf 29596 ComplUSGraphccusgr 30021 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-oadd 8508 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-dju 10009 df-card 10047 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-3 12433 df-4 12434 df-5 12435 df-6 12436 df-7 12437 df-8 12438 df-9 12439 df-n0 12634 df-xnn0 12707 df-z 12721 df-dec 12842 df-uz 12993 df-fz 13667 df-hash 14502 df-struct 17354 df-sets 17371 df-slot 17389 df-ndx 17401 df-base 17417 df-plusg 17470 df-mulr 17471 df-starv 17472 df-tset 17476 df-ple 17477 df-ds 17479 df-unif 17480 df-cnfld 21709 df-edgf 29597 df-vtx 29606 df-iedg 29607 df-edg 29656 df-usgr 29762 df-nbgr 29944 df-uvtx 29997 df-cplgr 30022 df-cusgr 30023 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |