Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cnnv | Structured version Visualization version GIF version |
Description: The set of complex numbers is a normed complex vector space. The vector operation is +, the scalar product is ·, and the norm function is abs. (Contributed by Steve Rodriguez, 3-Dec-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cnnv.6 | ⊢ 𝑈 = 〈〈 + , · 〉, abs〉 |
Ref | Expression |
---|---|
cnnv | ⊢ 𝑈 ∈ NrmCVec |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnaddabloOLD 28844 | . . . 4 ⊢ + ∈ AbelOp | |
2 | ablogrpo 28810 | . . . 4 ⊢ ( + ∈ AbelOp → + ∈ GrpOp) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ + ∈ GrpOp |
4 | ax-addf 10881 | . . . 4 ⊢ + :(ℂ × ℂ)⟶ℂ | |
5 | 4 | fdmi 6596 | . . 3 ⊢ dom + = (ℂ × ℂ) |
6 | 3, 5 | grporn 28784 | . 2 ⊢ ℂ = ran + |
7 | cnidOLD 28845 | . 2 ⊢ 0 = (GId‘ + ) | |
8 | cncvcOLD 28846 | . 2 ⊢ 〈 + , · 〉 ∈ CVecOLD | |
9 | absf 14977 | . 2 ⊢ abs:ℂ⟶ℝ | |
10 | abs00 14929 | . . 3 ⊢ (𝑥 ∈ ℂ → ((abs‘𝑥) = 0 ↔ 𝑥 = 0)) | |
11 | 10 | biimpa 476 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ (abs‘𝑥) = 0) → 𝑥 = 0) |
12 | absmul 14934 | . 2 ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(𝑦 · 𝑥)) = ((abs‘𝑦) · (abs‘𝑥))) | |
13 | abstri 14970 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (abs‘(𝑥 + 𝑦)) ≤ ((abs‘𝑥) + (abs‘𝑦))) | |
14 | cnnv.6 | . 2 ⊢ 𝑈 = 〈〈 + , · 〉, abs〉 | |
15 | 6, 7, 8, 9, 11, 12, 13, 14 | isnvi 28876 | 1 ⊢ 𝑈 ∈ NrmCVec |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∈ wcel 2108 〈cop 4564 × cxp 5578 ‘cfv 6418 ℂcc 10800 0cc0 10802 + caddc 10805 · cmul 10807 abscabs 14873 GrpOpcgr 28752 AbelOpcablo 28807 NrmCVeccnv 28847 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-addf 10881 ax-mulf 10882 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-grpo 28756 df-gid 28757 df-ablo 28808 df-vc 28822 df-nv 28855 |
This theorem is referenced by: cnnvm 28945 elimnvu 28947 cnims 28956 cncph 29082 ipblnfi 29118 cnbn 29132 htthlem 29180 |
Copyright terms: Public domain | W3C validator |