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 30729

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 30704	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
3		nvmval.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
4	3, 1	bafval 30691	. . . 4 ⊢ 𝑋 = ran 𝐺
5		eqid 2737	. . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺)
6		eqid 2737	. . . 4 ⊢ ( /_𝑔 ‘𝐺) = ( /_𝑔 ‘𝐺)
7	4, 5, 6	grpodivval 30622	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( /_𝑔 ‘𝐺)𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵)))
8	2, 7	syl3an1 1164	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( /_𝑔 ‘𝐺)𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵)))
9		nvmval.3	. . 3 ⊢ 𝑀 = ( −_𝑣 ‘𝑈)
10	3, 1, 9, 6	nvm 30728	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴( /_𝑔 ‘𝐺)𝐵))
11		nvmval.4	. . . . 5 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
12	3, 1, 11, 5	nvinv 30726	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (-1𝑆𝐵) = ((inv‘𝐺)‘𝐵))
13	12	3adant2 1132	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (-1𝑆𝐵) = ((inv‘𝐺)‘𝐵))
14	13	oveq2d 7384	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(-1𝑆𝐵)) = (𝐴𝐺((inv‘𝐺)‘𝐵)))
15	8, 10, 14	3eqtr4d 2782	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) = (𝐴𝐺(-1𝑆𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 1c1 11039 -cneg 11377 GrpOpcgr 30576 invcgn 30578 /_𝑔 cgs 30579 NrmCVeccnv 30671 +_𝑣 cpv 30672 BaseSetcba 30673 ·_𝑠OLD cns 30674 −_𝑣 cnsb 30676

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-ltxr 11183 df-sub 11378 df-neg 11379 df-grpo 30580 df-gid 30581 df-ginv 30582 df-gdiv 30583 df-ablo 30632 df-vc 30646 df-nv 30679 df-va 30682 df-ba 30683 df-sm 30684 df-0v 30685 df-vs 30686 df-nmcv 30687

This theorem is referenced by: nvmval2 30730 nvmdi 30735 nvpncan2 30740 nvaddsub4 30744 nvmtri 30758 imsdval2 30774 nvnd 30775 ipval3 30796 sspmval 30820 isph 30909 dipsubdir 30935

W3C validator