nvlinv - Metamath Proof Explorer

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

Theorem nvlinv 30711

Description: Minus a vector plus itself. (Contributed by NM, 4-Dec-2007.) (Revised by Mario Carneiro, 21-Dec-2013.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nvrinv.1	⊢ 𝑋 = (BaseSet‘𝑈)
nvrinv.2	⊢ 𝐺 = ( +_𝑣 ‘𝑈)
nvrinv.4	⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
nvrinv.6	⊢ 𝑍 = (0_vec‘𝑈)

**Assertion**
Ref	Expression
nvlinv	⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺𝐴) = 𝑍)

**Proof of Theorem nvlinv**
Step	Hyp	Ref	Expression
1		nvrinv.2	. . . 4 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
2	1	nvgrp 30676	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
3		nvrinv.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
4	3, 1	bafval 30663	. . . 4 ⊢ 𝑋 = ran 𝐺
5		eqid 2735	. . . 4 ⊢ (GId‘𝐺) = (GId‘𝐺)
6		eqid 2735	. . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺)
7	4, 5, 6	grpolinv 30585	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (((inv‘𝐺)‘𝐴)𝐺𝐴) = (GId‘𝐺))
8	2, 7	sylan 581	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (((inv‘𝐺)‘𝐴)𝐺𝐴) = (GId‘𝐺))
9		nvrinv.4	. . . 4 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
10	3, 1, 9, 6	nvinv 30698	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = ((inv‘𝐺)‘𝐴))
11	10	oveq1d 7371	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺𝐴) = (((inv‘𝐺)‘𝐴)𝐺𝐴))
12		nvrinv.6	. . . 4 ⊢ 𝑍 = (0_vec‘𝑈)
13	1, 12	0vfval 30665	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝑍 = (GId‘𝐺))
14	13	adantr 480	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 𝑍 = (GId‘𝐺))
15	8, 11, 14	3eqtr4d 2780	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((-1𝑆𝐴)𝐺𝐴) = 𝑍)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ‘cfv 6487 (class class class)co 7356 1c1 11028 -cneg 11367 GrpOpcgr 30548 GIdcgi 30549 invcgn 30550 NrmCVeccnv 30643 +_𝑣 cpv 30644 BaseSetcba 30645 ·_𝑠OLD cns 30646 0_veccn0v 30647

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 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103

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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-po 5528 df-so 5529 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-er 8632 df-en 8883 df-dom 8884 df-sdom 8885 df-pnf 11170 df-mnf 11171 df-ltxr 11173 df-sub 11368 df-neg 11369 df-grpo 30552 df-gid 30553 df-ginv 30554 df-ablo 30604 df-vc 30618 df-nv 30651 df-va 30654 df-ba 30655 df-sm 30656 df-0v 30657 df-nmcv 30659

This theorem is referenced by: nvabs 30731 imsmetlem 30749 lno0 30815

W3C validator