vcm - Metamath Proof Explorer

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

Theorem vcm 29829

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

**Hypotheses**
Ref	Expression
vcm.1	⊢ 𝐺 = (1^st ‘𝑊)
vcm.2	⊢ 𝑆 = (2^nd ‘𝑊)
vcm.3	⊢ 𝑋 = ran 𝐺
vcm.4	⊢ 𝑀 = (inv‘𝐺)

**Assertion**
Ref	Expression
vcm	⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = (𝑀‘𝐴))

**Proof of Theorem vcm**
Step	Hyp	Ref	Expression
1		vcm.1	. . . . 5 ⊢ 𝐺 = (1^st ‘𝑊)
2	1	vcgrp 29823	. . . 4 ⊢ (𝑊 ∈ CVec_OLD → 𝐺 ∈ GrpOp)
3	2	adantr 482	. . 3 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → 𝐺 ∈ GrpOp)
4		neg1cn 12326	. . . 4 ⊢ -1 ∈ ℂ
5		vcm.2	. . . . 5 ⊢ 𝑆 = (2^nd ‘𝑊)
6		vcm.3	. . . . 5 ⊢ 𝑋 = ran 𝐺
7	1, 5, 6	vccl 29816	. . . 4 ⊢ ((𝑊 ∈ CVec_OLD ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋)
8	4, 7	mp3an2 1450	. . 3 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋)
9		eqid 2733	. . . 4 ⊢ (GId‘𝐺) = (GId‘𝐺)
10	6, 9	grporid 29770	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (-1𝑆𝐴) ∈ 𝑋) → ((-1𝑆𝐴)𝐺(GId‘𝐺)) = (-1𝑆𝐴))
11	3, 8, 10	syl2anc 585	. 2 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺(GId‘𝐺)) = (-1𝑆𝐴))
12		simpr 486	. . . . . 6 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
13		vcm.4	. . . . . . . 8 ⊢ 𝑀 = (inv‘𝐺)
14	6, 13	grpoinvcl 29777	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑀‘𝐴) ∈ 𝑋)
15	2, 14	sylan 581	. . . . . 6 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (𝑀‘𝐴) ∈ 𝑋)
16	6	grpoass 29756	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ ((-1𝑆𝐴) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑀‘𝐴) ∈ 𝑋)) → (((-1𝑆𝐴)𝐺𝐴)𝐺(𝑀‘𝐴)) = ((-1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))))
17	3, 8, 12, 15, 16	syl13anc 1373	. . . . 5 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (((-1𝑆𝐴)𝐺𝐴)𝐺(𝑀‘𝐴)) = ((-1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))))
18	1, 5, 6	vcidOLD 29817	. . . . . . . 8 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴)
19	18	oveq2d 7425	. . . . . . 7 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺(1𝑆𝐴)) = ((-1𝑆𝐴)𝐺𝐴))
20		ax-1cn 11168	. . . . . . . . . 10 ⊢ 1 ∈ ℂ
21		1pneg1e0 12331	. . . . . . . . . 10 ⊢ (1 + -1) = 0
22	20, 4, 21	addcomli 11406	. . . . . . . . 9 ⊢ (-1 + 1) = 0
23	22	oveq1i 7419	. . . . . . . 8 ⊢ ((-1 + 1)𝑆𝐴) = (0𝑆𝐴)
24	1, 5, 6	vcdir 29819	. . . . . . . . . 10 ⊢ ((𝑊 ∈ CVec_OLD ∧ (-1 ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((-1 + 1)𝑆𝐴) = ((-1𝑆𝐴)𝐺(1𝑆𝐴)))
25	4, 24	mp3anr1 1459	. . . . . . . . 9 ⊢ ((𝑊 ∈ CVec_OLD ∧ (1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((-1 + 1)𝑆𝐴) = ((-1𝑆𝐴)𝐺(1𝑆𝐴)))
26	20, 25	mpanr1 702	. . . . . . . 8 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1 + 1)𝑆𝐴) = ((-1𝑆𝐴)𝐺(1𝑆𝐴)))
27	1, 5, 6, 9	vc0 29827	. . . . . . . 8 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (0𝑆𝐴) = (GId‘𝐺))
28	23, 26, 27	3eqtr3a 2797	. . . . . . 7 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺(1𝑆𝐴)) = (GId‘𝐺))
29	19, 28	eqtr3d 2775	. . . . . 6 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺𝐴) = (GId‘𝐺))
30	29	oveq1d 7424	. . . . 5 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (((-1𝑆𝐴)𝐺𝐴)𝐺(𝑀‘𝐴)) = ((GId‘𝐺)𝐺(𝑀‘𝐴)))
31	17, 30	eqtr3d 2775	. . . 4 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))) = ((GId‘𝐺)𝐺(𝑀‘𝐴)))
32	6, 9, 13	grporinv 29780	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑀‘𝐴)) = (GId‘𝐺))
33	2, 32	sylan 581	. . . . 5 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑀‘𝐴)) = (GId‘𝐺))
34	33	oveq2d 7425	. . . 4 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))) = ((-1𝑆𝐴)𝐺(GId‘𝐺)))
35	31, 34	eqtr3d 2775	. . 3 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑀‘𝐴)) = ((-1𝑆𝐴)𝐺(GId‘𝐺)))
36	6, 9	grpolid 29769	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑀‘𝐴) ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑀‘𝐴)) = (𝑀‘𝐴))
37	3, 15, 36	syl2anc 585	. . 3 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑀‘𝐴)) = (𝑀‘𝐴))
38	35, 37	eqtr3d 2775	. 2 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺(GId‘𝐺)) = (𝑀‘𝐴))
39	11, 38	eqtr3d 2775	1 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = (𝑀‘𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ran crn 5678 ‘cfv 6544 (class class class)co 7409 1^st c1st 7973 2^nd c2nd 7974 ℂcc 11108 0cc0 11110 1c1 11111 + caddc 11113 -cneg 11445 GrpOpcgr 29742 GIdcgi 29743 invcgn 29744 CVec_OLDcvc 29811

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-po 5589 df-so 5590 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-ltxr 11253 df-sub 11446 df-neg 11447 df-grpo 29746 df-gid 29747 df-ginv 29748 df-ablo 29798 df-vc 29812

This theorem is referenced by: nvinv 29892

W3C validator