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

Theorem nvinvfval 30627
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 2731 . . . . 5 (BaseSet‘𝑈) = (BaseSet‘𝑈)
2 nvinvfval.4 . . . . 5 𝑆 = ( ·𝑠OLD𝑈)
31, 2nvsf 30606 . . . 4 (𝑈 ∈ NrmCVec → 𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈))
4 neg1cn 12116 . . . 4 -1 ∈ ℂ
5 nvinvfval.3 . . . . 5 𝑁 = (𝑆(2nd ↾ ({-1} × V)))
65curry1f 8042 . . . 4 ((𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈) ∧ -1 ∈ ℂ) → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
73, 4, 6sylancl 586 . . 3 (𝑈 ∈ NrmCVec → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
87ffnd 6658 . 2 (𝑈 ∈ NrmCVec → 𝑁 Fn (BaseSet‘𝑈))
9 nvinvfval.2 . . . 4 𝐺 = ( +𝑣𝑈)
109nvgrp 30604 . . 3 (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
111, 9bafval 30591 . . . 4 (BaseSet‘𝑈) = ran 𝐺
12 eqid 2731 . . . 4 (inv‘𝐺) = (inv‘𝐺)
1311, 12grpoinvf 30519 . . 3 (𝐺 ∈ GrpOp → (inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈))
14 f1ofn 6770 . . 3 ((inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈) → (inv‘𝐺) Fn (BaseSet‘𝑈))
1510, 13, 143syl 18 . 2 (𝑈 ∈ NrmCVec → (inv‘𝐺) Fn (BaseSet‘𝑈))
163ffnd 6658 . . . . 5 (𝑈 ∈ NrmCVec → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
1716adantr 480 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
185curry1val 8041 . . . 4 ((𝑆 Fn (ℂ × (BaseSet‘𝑈)) ∧ -1 ∈ ℂ) → (𝑁𝑥) = (-1𝑆𝑥))
1917, 4, 18sylancl 586 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁𝑥) = (-1𝑆𝑥))
201, 9, 2, 12nvinv 30626 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (-1𝑆𝑥) = ((inv‘𝐺)‘𝑥))
2119, 20eqtrd 2766 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁𝑥) = ((inv‘𝐺)‘𝑥))
228, 15, 21eqfnfvd 6973 1 (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  Vcvv 3436  {csn 4575   × cxp 5617  ccnv 5618  cres 5621  ccom 5623   Fn wfn 6482  wf 6483  1-1-ontowf1o 6486  cfv 6487  (class class class)co 7352  2nd c2nd 7926  cc 11010  1c1 11013  -cneg 11351  GrpOpcgr 30476  invcgn 30478  NrmCVeccnv 30571   +𝑣 cpv 30572  BaseSetcba 30573   ·𝑠OLD cns 30574
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-resscn 11069  ax-1cn 11070  ax-icn 11071  ax-addcl 11072  ax-addrcl 11073  ax-mulcl 11074  ax-mulrcl 11075  ax-mulcom 11076  ax-addass 11077  ax-mulass 11078  ax-distr 11079  ax-i2m1 11080  ax-1ne0 11081  ax-1rid 11082  ax-rnegex 11083  ax-rrecex 11084  ax-cnre 11085  ax-pre-lttri 11086  ax-pre-lttrn 11087  ax-pre-ltadd 11088
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-po 5527  df-so 5528  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  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 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-1st 7927  df-2nd 7928  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-pnf 11154  df-mnf 11155  df-ltxr 11157  df-sub 11352  df-neg 11353  df-grpo 30480  df-gid 30481  df-ginv 30482  df-ablo 30532  df-vc 30546  df-nv 30579  df-va 30582  df-ba 30583  df-sm 30584  df-0v 30585  df-nmcv 30587
This theorem is referenced by:  hhssabloilem  31248
  Copyright terms: Public domain W3C validator