Theorem vcm 31178

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	⊢ 𝐺 = (1st ‘𝑊)
vcm.2	⊢ 𝑆 = (2nd ‘𝑊)
vcm.3	⊢ 𝑋 = ran 𝐺
vcm.4	⊢ 𝑀 = (inv‘𝐺)

Assertion

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

Proof of Theorem vcm

Step	Hyp	Ref	Expression
1		vcm.1	. . . . 5 ⊢ 𝐺 = (1st ‘𝑊)
2	1	vcgrp 31172	. . . 4 ⊢ (𝑊 ∈ CVecOLD → 𝐺 ∈ GrpOp)
3	2	adantr 486	. . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → 𝐺 ∈ GrpOp)
4		neg1cn 12305	. . . 4 ⊢ -1 ∈ ℂ
5		vcm.2	. . . . 5 ⊢ 𝑆 = (2nd ‘𝑊)
6		vcm.3	. . . . 5 ⊢ 𝑋 = ran 𝐺
7	1, 5, 6	vccl 31165	. . . 4 ⊢ ((𝑊 ∈ CVecOLD ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ( -1𝑆𝐴) ∈ 𝑋)
8	4, 7	mp3an2 1478	. . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ( -1𝑆𝐴) ∈ 𝑋)
9		eqid 2760	. . . 4 ⊢ (GId‘𝐺) = (GId‘𝐺)
10	6, 9	grporid 31119	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ( -1𝑆𝐴) ∈ 𝑋) → (( -1𝑆𝐴)𝐺(GId‘𝐺)) = ( -1𝑆𝐴))
11	3, 8, 10	syl2anc 596	. 2 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐴)𝐺(GId‘𝐺)) = ( -1𝑆𝐴))
12		simpr 490	. . . . . 6 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
13		vcm.4	. . . . . . . 8 ⊢ 𝑀 = (inv‘𝐺)
14	6, 13	grpoinvcl 31126	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑀‘𝐴) ∈ 𝑋)
15	2, 14	sylan 592	. . . . . 6 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (𝑀‘𝐴) ∈ 𝑋)
16	6	grpoass 31105	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ (( -1𝑆𝐴) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑀‘𝐴) ∈ 𝑋)) → ((( -1𝑆𝐴)𝐺𝐴)𝐺(𝑀‘𝐴)) = (( -1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))))
17	3, 8, 12, 15, 16	syl13anc 1399	. . . . 5 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((( -1𝑆𝐴)𝐺𝐴)𝐺(𝑀‘𝐴)) = (( -1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))))
18	1, 5, 6	vcidOLD 31166	. . . . . . . 8 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴)
19	18	oveq2d 7436	. . . . . . 7 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐴)𝐺(1𝑆𝐴)) = (( -1𝑆𝐴)𝐺𝐴))
20		ax-1cn 11258	. . . . . . . . . 10 ⊢ 1 ∈ ℂ
21		1pneg1e0 12460	. . . . . . . . . 10 ⊢ (1 + -1) = 0
22	20, 4, 21	addcomli 11502	. . . . . . . . 9 ⊢ ( -1 + 1) = 0
23	22	oveq1i 7430	. . . . . . . 8 ⊢ (( -1 + 1)𝑆𝐴) = (0𝑆𝐴)
24	1, 5, 6	vcdir 31168	. . . . . . . . . 10 ⊢ ((𝑊 ∈ CVecOLD ∧ ( -1 ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → (( -1 + 1)𝑆𝐴) = (( -1𝑆𝐴)𝐺(1𝑆𝐴)))
25	4, 24	mp3anr1 1487	. . . . . . . . 9 ⊢ ((𝑊 ∈ CVecOLD ∧ (1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → (( -1 + 1)𝑆𝐴) = (( -1𝑆𝐴)𝐺(1𝑆𝐴)))
26	20, 25	mpanr1 716	. . . . . . . 8 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1 + 1)𝑆𝐴) = (( -1𝑆𝐴)𝐺(1𝑆𝐴)))
27	1, 5, 6, 9	vc0 31176	. . . . . . . 8 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (0𝑆𝐴) = (GId‘𝐺))
28	23, 26, 27	3eqtr3a 2819	. . . . . . 7 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐴)𝐺(1𝑆𝐴)) = (GId‘𝐺))
29	19, 28	eqtr3d 2797	. . . . . 6 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐴)𝐺𝐴) = (GId‘𝐺))
30	29	oveq1d 7435	. . . . 5 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((( -1𝑆𝐴)𝐺𝐴)𝐺(𝑀‘𝐴)) = ((GId‘𝐺)𝐺(𝑀‘𝐴)))
31	17, 30	eqtr3d 2797	. . . 4 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))) = ((GId‘𝐺)𝐺(𝑀‘𝐴)))
32	6, 9, 13	grporinv 31129	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑀‘𝐴)) = (GId‘𝐺))
33	2, 32	sylan 592	. . . . 5 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑀‘𝐴)) = (GId‘𝐺))
34	33	oveq2d 7436	. . . 4 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐴)𝐺(𝐴𝐺(𝑀‘𝐴))) = (( -1𝑆𝐴)𝐺(GId‘𝐺)))
35	31, 34	eqtr3d 2797	. . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑀‘𝐴)) = (( -1𝑆𝐴)𝐺(GId‘𝐺)))
36	6, 9	grpolid 31118	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑀‘𝐴) ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑀‘𝐴)) = (𝑀‘𝐴))
37	3, 15, 36	syl2anc 596	. . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑀‘𝐴)) = (𝑀‘𝐴))
38	35, 37	eqtr3d 2797	. 2 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐴)𝐺(GId‘𝐺)) = (𝑀‘𝐴))
39	11, 38	eqtr3d 2797	1 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ( -1𝑆𝐴) = (𝑀‘𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ran crn 5651  ‘cfv 6538  (class class class)co 7420  1^st c1st 7999  2^nd c2nd 8000  ℂcc 11198  0cc0 11200  1c1 11201   + caddc 11203   -cneg 11542  GrpOpcgr 31091  GIdcgi 31092  invcgn 31093  CVec_OLDcvc 31160

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  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 5545  df-po 5558  df-so 5559  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-pnf 11345  df-mnf 11346  df-ltxr 11348  df-sub 11543  df-neg 11544  df-grpo 31095  df-gid 31096  df-ginv 31097  df-ablo 31147  df-vc 31161

This theorem is used by:  nvinv  31241