| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnfldcj | GIF version | ||
| Description: The conjugation operation of the field of complex numbers. (Contributed by Mario Carneiro, 6-Oct-2015.) (Revised by Thierry Arnoux, 17-Dec-2017.) (Revised by Thierry Arnoux, 17-Dec-2017.) |
| Ref | Expression |
|---|---|
| cnfldcj | ⊢ ∗ = (*𝑟‘ℂfld) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cjf 11374 | . . 3 ⊢ ∗:ℂ⟶ℂ | |
| 2 | cnex 8134 | . . 3 ⊢ ℂ ∈ V | |
| 3 | fex 5872 | . . 3 ⊢ ((∗:ℂ⟶ℂ ∧ ℂ ∈ V) → ∗ ∈ V) | |
| 4 | 1, 2, 3 | mp2an 426 | . 2 ⊢ ∗ ∈ V |
| 5 | cnfldstr 14538 | . . 3 ⊢ ℂfld Struct 〈1, ;13〉 | |
| 6 | starvslid 13190 | . . 3 ⊢ (*𝑟 = Slot (*𝑟‘ndx) ∧ (*𝑟‘ndx) ∈ ℕ) | |
| 7 | ssun2 3368 | . . . 4 ⊢ {〈(*𝑟‘ndx), ∗〉} ⊆ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))〉, 〈(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) | |
| 8 | ssun1 3367 | . . . . 5 ⊢ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))〉, 〈(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ⊆ (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))〉, 〈(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) | |
| 9 | df-cnfld 14537 | . . . . 5 ⊢ ℂfld = (({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))〉, 〈(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ∪ ({〈(TopSet‘ndx), (MetOpen‘(abs ∘ − ))〉, 〈(le‘ndx), ≤ 〉, 〈(dist‘ndx), (abs ∘ − )〉} ∪ {〈(UnifSet‘ndx), (metUnif‘(abs ∘ − ))〉})) | |
| 10 | 8, 9 | sseqtrri 3259 | . . . 4 ⊢ ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))〉, 〈(.r‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))〉} ∪ {〈(*𝑟‘ndx), ∗〉}) ⊆ ℂfld |
| 11 | 7, 10 | sstri 3233 | . . 3 ⊢ {〈(*𝑟‘ndx), ∗〉} ⊆ ℂfld |
| 12 | 5, 6, 11 | strslfv 13093 | . 2 ⊢ (∗ ∈ V → ∗ = (*𝑟‘ℂfld)) |
| 13 | 4, 12 | ax-mp 5 | 1 ⊢ ∗ = (*𝑟‘ℂfld) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1395 ∈ wcel 2200 Vcvv 2799 ∪ cun 3195 {csn 3666 {ctp 3668 〈cop 3669 ∘ ccom 4723 ⟶wf 5314 ‘cfv 5318 (class class class)co 6007 ∈ cmpo 6009 ℂcc 8008 1c1 8011 + caddc 8013 · cmul 8015 ≤ cle 8193 − cmin 8328 3c3 9173 ;cdc 9589 ∗ccj 11366 abscabs 11524 ndxcnx 13045 Basecbs 13048 +gcplusg 13126 .rcmulr 13127 *𝑟cstv 13128 TopSetcts 13132 lecple 13133 distcds 13135 UnifSetcunif 13136 MetOpencmopn 14521 metUnifcmetu 14522 ℂfldccnfld 14536 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-tp 3674 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-5 9183 df-6 9184 df-7 9185 df-8 9186 df-9 9187 df-n0 9381 df-z 9458 df-dec 9590 df-uz 9734 df-rp 9862 df-fz 10217 df-cj 11369 df-abs 11526 df-struct 13050 df-ndx 13051 df-slot 13052 df-base 13054 df-plusg 13139 df-mulr 13140 df-starv 13141 df-tset 13145 df-ple 13146 df-ds 13148 df-unif 13149 df-topgen 13309 df-bl 14526 df-mopn 14527 df-fg 14529 df-metu 14530 df-cnfld 14537 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |