| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnnvba | Structured version Visualization version GIF version | ||
| Description: The base set of the normed complex vector space of complex numbers. (Contributed by NM, 7-Nov-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cnnvba.6 | ⊢ 𝑈 = 〈〈 + , · 〉, abs〉 |
| Ref | Expression |
|---|---|
| cnnvba | ⊢ ℂ = (BaseSet‘𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnnvba.6 | . . . 4 ⊢ 𝑈 = 〈〈 + , · 〉, abs〉 | |
| 2 | 1 | cnnvg 31105 | . . 3 ⊢ + = ( +𝑣 ‘𝑈) |
| 3 | 2 | rneqi 5929 | . 2 ⊢ ran + = ran ( +𝑣 ‘𝑈) |
| 4 | cnaddabloOLD 31008 | . . . 4 ⊢ + ∈ AbelOp | |
| 5 | ablogrpo 30974 | . . . 4 ⊢ ( + ∈ AbelOp → + ∈ GrpOp) | |
| 6 | 4, 5 | ax-mp 5 | . . 3 ⊢ + ∈ GrpOp |
| 7 | ax-addf 11198 | . . . 4 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 8 | 7 | fdmi 6721 | . . 3 ⊢ dom + = (ℂ × ℂ) |
| 9 | 6, 8 | grporn 30948 | . 2 ⊢ ℂ = ran + |
| 10 | eqid 2765 | . . 3 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈) | |
| 11 | eqid 2765 | . . 3 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 12 | 10, 11 | bafval 31031 | . 2 ⊢ (BaseSet‘𝑈) = ran ( +𝑣 ‘𝑈) |
| 13 | 3, 9, 12 | 3eqtr4i 2798 | 1 ⊢ ℂ = (BaseSet‘𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 〈cop 4597 × cxp 5661 ran crn 5664 ‘cfv 6540 ℂcc 11117 + caddc 11122 · cmul 11124 abscabs 15313 GrpOpcgr 30916 AbelOpcablo 30971 +𝑣 cpv 31012 BaseSetcba 31013 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11175 ax-resscn 11176 ax-1cn 11177 ax-icn 11178 ax-addcl 11179 ax-addrcl 11180 ax-mulcl 11181 ax-mulrcl 11182 ax-mulcom 11183 ax-addass 11184 ax-mulass 11185 ax-distr 11186 ax-i2m1 11187 ax-1ne0 11188 ax-1rid 11189 ax-rnegex 11190 ax-rrecex 11191 ax-cnre 11192 ax-pre-lttri 11193 ax-pre-lttrn 11194 ax-pre-ltadd 11195 ax-pre-mulgt0 11196 ax-pre-sup 11197 ax-addf 11198 ax-mulf 11199 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-sup 9409 df-pnf 11264 df-mnf 11265 df-xr 11266 df-ltxr 11267 df-le 11268 df-sub 11462 df-neg 11463 df-div 11891 df-nn 12253 df-2 12322 df-3 12323 df-n0 12524 df-z 12611 df-uz 12883 df-rp 13037 df-seq 14060 df-exp 14120 df-cj 15178 df-re 15179 df-im 15180 df-sqrt 15314 df-abs 15315 df-grpo 30920 df-ablo 30972 df-va 31022 df-ba 31023 |
| This theorem is used by: cnnvm 31109 ipblnfi 31282 cnbn 31296 htthlem 31344 |
| Copyright terms: Public domain | W3C validator |