| 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 30656 | . . . 4 ⊢ + ∈ AbelOp | |
| 2 | ablogrpo 30622 | . . . 4 ⊢ ( + ∈ AbelOp → + ∈ GrpOp) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ + ∈ GrpOp |
| 4 | ax-addf 11105 | . . . 4 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 5 | 4 | fdmi 6673 | . . 3 ⊢ dom + = (ℂ × ℂ) |
| 6 | 3, 5 | grporn 30596 | . 2 ⊢ ℂ = ran + |
| 7 | cnidOLD 30657 | . 2 ⊢ 0 = (GId‘ + ) | |
| 8 | cncvcOLD 30658 | . 2 ⊢ 〈 + , · 〉 ∈ CVecOLD | |
| 9 | absf 15261 | . 2 ⊢ abs:ℂ⟶ℝ | |
| 10 | abs00 15212 | . . 3 ⊢ (𝑥 ∈ ℂ → ((abs‘𝑥) = 0 ↔ 𝑥 = 0)) | |
| 11 | 10 | biimpa 476 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ (abs‘𝑥) = 0) → 𝑥 = 0) |
| 12 | absmul 15217 | . 2 ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(𝑦 · 𝑥)) = ((abs‘𝑦) · (abs‘𝑥))) | |
| 13 | abstri 15254 | . 2 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (abs‘(𝑥 + 𝑦)) ≤ ((abs‘𝑥) + (abs‘𝑦))) | |
| 14 | cnnv.6 | . 2 ⊢ 𝑈 = 〈〈 + , · 〉, abs〉 | |
| 15 | 6, 7, 8, 9, 11, 12, 13, 14 | isnvi 30688 | 1 ⊢ 𝑈 ∈ NrmCVec |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∈ wcel 2113 〈cop 4586 × cxp 5622 ‘cfv 6492 ℂcc 11024 0cc0 11026 + caddc 11029 · cmul 11031 abscabs 15157 GrpOpcgr 30564 AbelOpcablo 30619 NrmCVeccnv 30659 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 ax-addf 11105 ax-mulf 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-seq 13925 df-exp 13985 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-grpo 30568 df-gid 30569 df-ablo 30620 df-vc 30634 df-nv 30667 |
| This theorem is referenced by: cnnvm 30757 elimnvu 30759 cnims 30768 cncph 30894 ipblnfi 30930 cnbn 30944 htthlem 30992 |
| Copyright terms: Public domain | W3C validator |