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

Theorem nvinvfval 31063
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 2765 . . . . 5 (BaseSet‘𝑈) = (BaseSet‘𝑈)
2 nvinvfval.4 . . . . 5 𝑆 = ( ·𝑠OLD𝑈)
31, 2nvsf 31042 . . . 4 (𝑈 ∈ NrmCVec → 𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈))
4 neg1cn 12218 . . . 4 -1 ∈ ℂ
5 nvinvfval.3 . . . . 5 𝑁 = (𝑆(2nd ↾ ({-1} × V)))
65curry1f 8107 . . . 4 ((𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈) ∧ -1 ∈ ℂ) → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
73, 4, 6sylancl 598 . . 3 (𝑈 ∈ NrmCVec → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈))
87ffnd 6710 . 2 (𝑈 ∈ NrmCVec → 𝑁 Fn (BaseSet‘𝑈))
9 nvinvfval.2 . . . 4 𝐺 = ( +𝑣𝑈)
109nvgrp 31040 . . 3 (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp)
111, 9bafval 31027 . . . 4 (BaseSet‘𝑈) = ran 𝐺
12 eqid 2765 . . . 4 (inv‘𝐺) = (inv‘𝐺)
1311, 12grpoinvf 30955 . . 3 (𝐺 ∈ GrpOp → (inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈))
14 f1ofn 6825 . . 3 ((inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈) → (inv‘𝐺) Fn (BaseSet‘𝑈))
1510, 13, 143syl 19 . 2 (𝑈 ∈ NrmCVec → (inv‘𝐺) Fn (BaseSet‘𝑈))
163ffnd 6710 . . . . 5 (𝑈 ∈ NrmCVec → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
1716adantr 486 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
185curry1val 8106 . . . 4 ((𝑆 Fn (ℂ × (BaseSet‘𝑈)) ∧ -1 ∈ ℂ) → (𝑁𝑥) = (-1𝑆𝑥))
1917, 4, 18sylancl 598 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁𝑥) = (-1𝑆𝑥))
201, 9, 2, 12nvinv 31062 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (-1𝑆𝑥) = ((inv‘𝐺)‘𝑥))
2119, 20eqtrd 2800 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁𝑥) = ((inv‘𝐺)‘𝑥))
228, 15, 21eqfnfvd 7032 1 (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3457  {csn 4591   × cxp 5661  ccnv 5662  cres 5665  ccom 5667   Fn wfn 6535  wf 6536  1-1-ontowf1o 6539  cfv 6540  (class class class)co 7419  2nd c2nd 7991  cc 11113  1c1 11116  -cneg 11457  GrpOpcgr 30912  invcgn 30914  NrmCVeccnv 31007   +𝑣 cpv 31008  BaseSetcba 31009   ·𝑠OLD cns 31010
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-mulcom 11179  ax-addass 11180  ax-mulass 11181  ax-distr 11182  ax-i2m1 11183  ax-1ne0 11184  ax-1rid 11185  ax-rnegex 11186  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189  ax-pre-lttrn 11190  ax-pre-ltadd 11191
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-po 5571  df-so 5572  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-pnf 11260  df-mnf 11261  df-ltxr 11263  df-sub 11458  df-neg 11459  df-grpo 30916  df-gid 30917  df-ginv 30918  df-ablo 30968  df-vc 30982  df-nv 31015  df-va 31018  df-ba 31019  df-sm 31020  df-0v 31021  df-nmcv 31023
This theorem is used by:  hhssabloilem  31684
  Copyright terms: Public domain W3C validator