Theorem nvinvfval 26879

Description: Function for the negative of a vector on a normed complex vector space, in terms of the underlying addition group inverse. (We currently do not have a separate notation for the negative of a vector.) (Contributed by NM, 27-Mar-2008.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nvinvfval.2	⊢ 𝐺 = ( +𝑣 ‘𝑈)
nvinvfval.4	⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
nvinvfval.3	⊢ 𝑁 = (𝑆 ∘ ◡(2nd ↾ ({-1} × V)))

Assertion

Ref	Expression
nvinvfval	⊢ (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺))

Proof of Theorem nvinvfval

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2610	. . . . 5 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
2		nvinvfval.4	. . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
3	1, 2	nvsf 26858	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈))
4		neg1cn 11001	. . . 4 ⊢ -1 ∈ ℂ
5		nvinvfval.3	. . . . 5 ⊢ 𝑁 = (𝑆 ∘ ◡(2nd ↾ ({-1} × V)))
6	5	curry1f 7158	. . . 4 ⊢ ((𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈) ∧ -1 ∈ ℂ) → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
7	3, 4, 6	sylancl 693	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
8		ffn 5958	. . 3 ⊢ (𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈) → 𝑁 Fn (BaseSet‘𝑈))
9	7, 8	syl 17	. 2 ⊢ (𝑈 ∈ NrmCVec → 𝑁 Fn (BaseSet‘𝑈))
10		nvinvfval.2	. . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
11	10	nvgrp 26856	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
12	1, 10	bafval 26843	. . . 4 ⊢ (BaseSet‘𝑈) = ran 𝐺
13		eqid 2610	. . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺)
14	12, 13	grpoinvf 26770	. . 3 ⊢ (𝐺 ∈ GrpOp → (inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈))
15		f1ofn 6051	. . 3 ⊢ ((inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈) → (inv‘𝐺) Fn (BaseSet‘𝑈))
16	11, 14, 15	3syl 18	. 2 ⊢ (𝑈 ∈ NrmCVec → (inv‘𝐺) Fn (BaseSet‘𝑈))
17		ffn 5958	. . . . . 6 ⊢ (𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈) → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
18	3, 17	syl 17	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
19	18	adantr 480	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
20	5	curry1val 7157	. . . 4 ⊢ ((𝑆 Fn (ℂ × (BaseSet‘𝑈)) ∧ -1 ∈ ℂ) → (𝑁‘𝑥) = (-1𝑆𝑥))
21	19, 4, 20	sylancl 693	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁‘𝑥) = (-1𝑆𝑥))
22	1, 10, 2, 13	nvinv 26878	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (-1𝑆𝑥) = ((inv‘𝐺)‘𝑥))
23	21, 22	eqtrd 2644	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁‘𝑥) = ((inv‘𝐺)‘𝑥))
24	9, 16, 23	eqfnfvd 6222	1 ⊢ (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺))

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  {csn 4125   × cxp 5036  ^◡ccnv 5037   ↾ cres 5040   ∘ ccom 5042   Fn wfn 5799  ⟶wf 5800  –1-1-onto→wf1o 5803  ‘cfv 5804  (class class class)co 6549  2^nd c2nd 7058  ℂcc 9813  1c1 9816  -cneg 10146  GrpOpcgr 26727  invcgn 26729  NrmCVeccnv 26823   +_𝑣 cpv 26824  BaseSetcba 26825   ·_𝑠OLD cns 26826

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-po 4959  df-so 4960  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-ltxr 9958  df-sub 10147  df-neg 10148  df-grpo 26731  df-gid 26732  df-ginv 26733  df-ablo 26783  df-vc 26798  df-nv 26831  df-va 26834  df-ba 26835  df-sm 26836  df-0v 26837  df-nmcv 26839

This theorem is referenced by:  hhssabloilem  27502