nvinv - Metamath Proof Explorer

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

Theorem nvinv 31174

Description: Minus 1 times a vector is the underlying group's inverse element. Equation 2 of [Kreyszig] p. 51. (Contributed by NM, 15-Feb-2008.) (New usage is discouraged.)

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

**Assertion**
Ref	Expression
nvinv	⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = (𝑀‘𝐴))

**Proof of Theorem nvinv**
Step	Hyp	Ref	Expression
1		eqid 2760	. . 3 ⊢ (1^st ‘𝑈) = (1^st ‘𝑈)
2	1	nvvc 31150	. 2 ⊢ (𝑈 ∈ NrmCVec → (1^st ‘𝑈) ∈ CVec_OLD)
3		nvinv.2	. . . 4 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
4	3	vafval 31138	. . 3 ⊢ 𝐺 = (1^st ‘(1^st ‘𝑈))
5		nvinv.4	. . . 4 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
6	5	smfval 31140	. . 3 ⊢ 𝑆 = (2^nd ‘(1^st ‘𝑈))
7		nvinv.1	. . . 4 ⊢ 𝑋 = (BaseSet‘𝑈)
8	7, 3	bafval 31139	. . 3 ⊢ 𝑋 = ran 𝐺
9		nvinv.5	. . 3 ⊢ 𝑀 = (inv‘𝐺)
10	4, 6, 8, 9	vcm 31111	. 2 ⊢ (((1^st ‘𝑈) ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = (𝑀‘𝐴))
11	2, 10	sylan 592	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = (𝑀‘𝐴))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6527 (class class class)co 7408 1^st c1st 7982 1c1 11172 -cneg 11513 invcgn 31026 CVec_OLDcvc 31093 NrmCVeccnv 31119 +_𝑣 cpv 31120 BaseSetcba 31121 ·_𝑠OLD cns 31122

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247

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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-ltxr 11319 df-sub 11514 df-neg 11515 df-grpo 31028 df-gid 31029 df-ginv 31030 df-ablo 31080 df-vc 31094 df-nv 31127 df-va 31130 df-ba 31131 df-sm 31132 df-0v 31133 df-nmcv 31135

This theorem is used by: nvinvfval 31175 nvmval 31177 nvmfval 31179 nvnegneg 31184 nvrinv 31186 nvlinv 31187

W3C validator