nvmval - Metamath Proof Explorer

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

Theorem nvmval 27337

Description: Value of vector subtraction on a normed complex vector space. (Contributed by NM, 11-Sep-2007.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nvmval.1	⊢ 𝑋 = (BaseSet‘𝑈)
nvmval.2	⊢ 𝐺 = ( +_𝑣 ‘𝑈)
nvmval.4	⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
nvmval.3	⊢ 𝑀 = ( −_𝑣 ‘𝑈)

**Assertion**
Ref	Expression
nvmval	⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴𝐺(-1𝑆𝐵)))

**Proof of Theorem nvmval**
Step	Hyp	Ref	Expression
1		nvmval.2	. . . 4 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
2	1	nvgrp 27312	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
3		nvmval.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
4	3, 1	bafval 27299	. . . 4 ⊢ 𝑋 = ran 𝐺
5		eqid 2626	. . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺)
6		eqid 2626	. . . 4 ⊢ ( /_𝑔 ‘𝐺) = ( /_𝑔 ‘𝐺)
7	4, 5, 6	grpodivval 27229	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( /_𝑔 ‘𝐺)𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵)))
8	2, 7	syl3an1 1356	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( /_𝑔 ‘𝐺)𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵)))
9		nvmval.3	. . 3 ⊢ 𝑀 = ( −_𝑣 ‘𝑈)
10	3, 1, 9, 6	nvm 27336	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴( /_𝑔 ‘𝐺)𝐵))
11		nvmval.4	. . . . 5 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
12	3, 1, 11, 5	nvinv 27334	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (-1𝑆𝐵) = ((inv‘𝐺)‘𝐵))
13	12	3adant2 1078	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (-1𝑆𝐵) = ((inv‘𝐺)‘𝐵))
14	13	oveq2d 6621	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(-1𝑆𝐵)) = (𝐴𝐺((inv‘𝐺)‘𝐵)))
15	8, 10, 14	3eqtr4d 2670	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴𝐺(-1𝑆𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1036 = wceq 1480 ∈ wcel 1992 ‘cfv 5850 (class class class)co 6605 1c1 9882 -cneg 10212 GrpOpcgr 27183 invcgn 27185 /_𝑔 cgs 27186 NrmCVeccnv 27279 +_𝑣 cpv 27280 BaseSetcba 27281 ·_𝑠OLD cns 27282 −_𝑣 cnsb 27284

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1719 ax-4 1734 ax-5 1841 ax-6 1890 ax-7 1937 ax-8 1994 ax-9 2001 ax-10 2021 ax-11 2036 ax-12 2049 ax-13 2250 ax-ext 2606 ax-rep 4736 ax-sep 4746 ax-nul 4754 ax-pow 4808 ax-pr 4872 ax-un 6903 ax-resscn 9938 ax-1cn 9939 ax-icn 9940 ax-addcl 9941 ax-addrcl 9942 ax-mulcl 9943 ax-mulrcl 9944 ax-mulcom 9945 ax-addass 9946 ax-mulass 9947 ax-distr 9948 ax-i2m1 9949 ax-1ne0 9950 ax-1rid 9951 ax-rnegex 9952 ax-rrecex 9953 ax-cnre 9954 ax-pre-lttri 9955 ax-pre-lttrn 9956 ax-pre-ltadd 9957

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1037 df-3an 1038 df-tru 1483 df-ex 1702 df-nf 1707 df-sb 1883 df-eu 2478 df-mo 2479 df-clab 2613 df-cleq 2619 df-clel 2622 df-nfc 2756 df-ne 2797 df-nel 2900 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3193 df-sbc 3423 df-csb 3520 df-dif 3563 df-un 3565 df-in 3567 df-ss 3574 df-nul 3897 df-if 4064 df-pw 4137 df-sn 4154 df-pr 4156 df-op 4160 df-uni 4408 df-iun 4492 df-br 4619 df-opab 4679 df-mpt 4680 df-id 4994 df-po 5000 df-so 5001 df-xp 5085 df-rel 5086 df-cnv 5087 df-co 5088 df-dm 5089 df-rn 5090 df-res 5091 df-ima 5092 df-iota 5813 df-fun 5852 df-fn 5853 df-f 5854 df-f1 5855 df-fo 5856 df-f1o 5857 df-fv 5858 df-riota 6566 df-ov 6608 df-oprab 6609 df-mpt2 6610 df-1st 7116 df-2nd 7117 df-er 7688 df-en 7901 df-dom 7902 df-sdom 7903 df-pnf 10021 df-mnf 10022 df-ltxr 10024 df-sub 10213 df-neg 10214 df-grpo 27187 df-gid 27188 df-ginv 27189 df-gdiv 27190 df-ablo 27239 df-vc 27254 df-nv 27287 df-va 27290 df-ba 27291 df-sm 27292 df-0v 27293 df-vs 27294 df-nmcv 27295

This theorem is referenced by: nvmval2 27338 nvmdi 27343 nvpncan2 27348 nvaddsub4 27352 nvmtri 27366 imsdval2 27382 nvnd 27383 ipval3 27404 sspmval 27428 isph 27517 dipsubdir 27543

W3C validator