cnnvg - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cnnvg		Structured version Visualization version GIF version

Theorem cnnvg 31310

Description: The vector addition (group) operation of the normed complex vector space of complex numbers. (Contributed by NM, 12-Jan-2008.) (New usage is discouraged.)

**Hypothesis**
Ref	Expression
cnnvg.6	⊢ 𝑈 = ⟨⟨ + , · ⟩, abs⟩

**Assertion**
Ref	Expression
cnnvg	⊢ + = ( +_𝑣 ‘𝑈)

**Proof of Theorem cnnvg**
Step	Hyp	Ref	Expression
1		eqid 2763	. . 3 ⊢ ( +_𝑣 ‘𝑈) = ( +_𝑣 ‘𝑈)
2	1	vafval 31235	. 2 ⊢ ( +_𝑣 ‘𝑈) = (1^st ‘(1^st ‘𝑈))
3		cnnvg.6	. . . . 5 ⊢ 𝑈 = ⟨⟨ + , · ⟩, abs⟩
4	3	fveq2i 6911	. . . 4 ⊢ (1^st ‘𝑈) = (1^st ‘⟨⟨ + , · ⟩, abs⟩)
5		opex 5436	. . . . 5 ⊢ ⟨ + , · ⟩ ∈ V
6		absf 15534	. . . . . 6 ⊢ abs:ℂ⟶ℝ
7		cnex 11308	. . . . . 6 ⊢ ℂ ∈ V
8		fex 7255	. . . . . 6 ⊢ ((abs:ℂ⟶ℝ ∧ ℂ ∈ V) → abs ∈ V)
9	6, 7, 8	mp2an 705	. . . . 5 ⊢ abs ∈ V
10	5, 9	op1st 8033	. . . 4 ⊢ (1^st ‘⟨⟨ + , · ⟩, abs⟩) = ⟨ + , · ⟩
11	4, 10	eqtri 2786	. . 3 ⊢ (1^st ‘𝑈) = ⟨ + , · ⟩
12	11	fveq2i 6911	. 2 ⊢ (1^st ‘(1^st ‘𝑈)) = (1^st ‘⟨ + , · ⟩)
13		addex 13144	. . 3 ⊢ + ∈ V
14		mulex 13146	. . 3 ⊢ · ∈ V
15	13, 14	op1st 8033	. 2 ⊢ (1^st ‘⟨ + , · ⟩) = +
16	2, 12, 15	3eqtrri 2791	1 ⊢ + = ( +_𝑣 ‘𝑈)

Colors of variables: wff setvar class

This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⟨cop 4838 ⟶wf 6554 ‘cfv 6558 1^st c1st 8023 ℂcc 11225 ℝcr 11226 + caddc 11230 · cmul 11232 abscabs 15430 +_𝑣 cpv 31217

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-rep 5235 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 ax-pre-sup 11305 ax-addf 11306 ax-mulf 11307

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-rmo 3369 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-op 4839 df-uni 4871 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-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-sup 9461 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-div 12001 df-nn 12363 df-2 12432 df-3 12433 df-n0 12634 df-z 12721 df-uz 12993 df-rp 13148 df-seq 14172 df-exp 14232 df-cj 15295 df-re 15296 df-im 15297 df-sqrt 15431 df-abs 15432 df-va 31227

This theorem is used by: cnnvba 31311 cnnvm 31314 ipblnfi 31487

W3C validator