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

Theorem nvinvfval 30726
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 2737 . . . . 5 (BaseSet‘𝑈) = (BaseSet‘𝑈)
2 nvinvfval.4 . . . . 5 𝑆 = ( ·𝑠OLD𝑈)
31, 2nvsf 30705 . . . 4 (𝑈 ∈ NrmCVec → 𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈))
4 neg1cn 12135 . . . 4 -1 ∈ ℂ
5 nvinvfval.3 . . . . 5 𝑁 = (𝑆(2nd ↾ ({-1} × V)))
65curry1f 8049 . . . 4 ((𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈) ∧ -1 ∈ ℂ) → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
73, 4, 6sylancl 587 . . 3 (𝑈 ∈ NrmCVec → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
87ffnd 6663 . 2 (𝑈 ∈ NrmCVec → 𝑁 Fn (BaseSet‘𝑈))
9 nvinvfval.2 . . . 4 𝐺 = ( +𝑣𝑈)
109nvgrp 30703 . . 3 (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
111, 9bafval 30690 . . . 4 (BaseSet‘𝑈) = ran 𝐺
12 eqid 2737 . . . 4 (inv‘𝐺) = (inv‘𝐺)
1311, 12grpoinvf 30618 . . 3 (𝐺 ∈ GrpOp → (inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈))
14 f1ofn 6775 . . 3 ((inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈) → (inv‘𝐺) Fn (BaseSet‘𝑈))
1510, 13, 143syl 18 . 2 (𝑈 ∈ NrmCVec → (inv‘𝐺) Fn (BaseSet‘𝑈))
163ffnd 6663 . . . . 5 (𝑈 ∈ NrmCVec → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
1716adantr 480 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
185curry1val 8048 . . . 4 ((𝑆 Fn (ℂ × (BaseSet‘𝑈)) ∧ -1 ∈ ℂ) → (𝑁𝑥) = (-1𝑆𝑥))
1917, 4, 18sylancl 587 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁𝑥) = (-1𝑆𝑥))
201, 9, 2, 12nvinv 30725 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (-1𝑆𝑥) = ((inv‘𝐺)‘𝑥))
2119, 20eqtrd 2772 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁𝑥) = ((inv‘𝐺)‘𝑥))
228, 15, 21eqfnfvd 6980 1 (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3430  {csn 4568   × cxp 5622  ccnv 5623  cres 5626  ccom 5628   Fn wfn 6487  wf 6488  1-1-ontowf1o 6491  cfv 6492  (class class class)co 7360  2nd c2nd 7934  cc 11027  1c1 11030  -cneg 11369  GrpOpcgr 30575  invcgn 30577  NrmCVeccnv 30670   +𝑣 cpv 30671  BaseSetcba 30672   ·𝑠OLD cns 30673
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 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-po 5532  df-so 5533  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-pnf 11172  df-mnf 11173  df-ltxr 11175  df-sub 11370  df-neg 11371  df-grpo 30579  df-gid 30580  df-ginv 30581  df-ablo 30631  df-vc 30645  df-nv 30678  df-va 30681  df-ba 30682  df-sm 30683  df-0v 30684  df-nmcv 30686
This theorem is referenced by:  hhssabloilem  31347
  Copyright terms: Public domain W3C validator