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

Theorem nvinvfval 31251
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.
StepHypRef Expression
1 eqid 2760 . . . . 5 (BaseSet‘𝑈) = (BaseSet‘𝑈)
2 nvinvfval.4 . . . . 5 𝑆 = ( ·𝑠OLD ‘𝑈)
31, 2nvsf 31230 . . . 4 (𝑈 ∈ NrmCVec → 𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈))
4 neg1cn 12312 . . . 4 -1 ∈ ℂ
5 nvinvfval.3 . . . . 5 𝑁 = (𝑆 ∘ ◡(2nd ↾ ({ -1} × V)))
65curry1f 8123 . . . 4 ((𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈) ∧ -1 ∈ ℂ) → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
73, 4, 6sylancl 598 . . 3 (𝑈 ∈ NrmCVec → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
87ffnd 6715 . 2 (𝑈 ∈ NrmCVec → 𝑁 Fn (BaseSet‘𝑈))
9 nvinvfval.2 . . . 4 𝐺 = ( +𝑣 ‘𝑈)
109nvgrp 31228 . . 3 (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
111, 9bafval 31215 . . . 4 (BaseSet‘𝑈) = ran 𝐺
12 eqid 2760 . . . 4 (inv‘𝐺) = (inv‘𝐺)
1311, 12grpoinvf 31143 . . 3 (𝐺 ∈ GrpOp → (inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈))
14 f1ofn 6830 . . 3 ((inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈) → (inv‘𝐺) Fn (BaseSet‘𝑈))
1510, 13, 143syl 19 . 2 (𝑈 ∈ NrmCVec → (inv‘𝐺) Fn (BaseSet‘𝑈))
163ffnd 6715 . . . . 5 (𝑈 ∈ NrmCVec → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
1716adantr 486 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
185curry1val 8122 . . . 4 ((𝑆 Fn (ℂ × (BaseSet‘𝑈)) ∧ -1 ∈ ℂ) → (𝑁‘𝑥) = ( -1𝑆𝑥))
1917, 4, 18sylancl 598 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁‘𝑥) = ( -1𝑆𝑥))
201, 9, 2, 12nvinv 31250 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → ( -1𝑆𝑥) = ((inv‘𝐺)‘𝑥))
2119, 20eqtrd 2795 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁‘𝑥) = ((inv‘𝐺)‘𝑥))
228, 15, 21eqfnfvd 7037 1 (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  {csn 4584   × cxp 5649  ◡ccnv 5650   ↾ cres 5653   ∘ ccom 5655   Fn wfn 6538  ⟶wf 6539  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7424  2nd c2nd 8004  ℂcc 11205  1c1 11208   -cneg 11549  GrpOpcgr 31100  invcgn 31102  NrmCVeccnv 31195   +𝑣 cpv 31196  BaseSetcba 31197   ·𝑠OLD cns 31198
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 5327  ax-pr 5391  ax-un 7755  ax-resscn 11264  ax-1cn 11265  ax-icn 11266  ax-addcl 11267  ax-addrcl 11268  ax-mulcl 11269  ax-mulrcl 11270  ax-mulcom 11271  ax-addass 11272  ax-mulass 11273  ax-distr 11274  ax-i2m1 11275  ax-1ne0 11276  ax-1rid 11277  ax-rnegex 11278  ax-rrecex 11279  ax-cnre 11280  ax-pre-lttri 11281  ax-pre-lttrn 11282  ax-pre-ltadd 11283
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 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-po 5559  df-so 5560  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-er 8724  df-en 8981  df-dom 8982  df-sdom 8983  df-pnf 11352  df-mnf 11353  df-ltxr 11355  df-sub 11550  df-neg 11551  df-grpo 31104  df-gid 31105  df-ginv 31106  df-ablo 31156  df-vc 31170  df-nv 31203  df-va 31206  df-ba 31207  df-sm 31208  df-0v 31209  df-nmcv 31211
This theorem is used by:  hhssabloilem  31872
  Copyright terms: Public domain W3C validator