| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvinvfval | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| nvinvfval.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| nvinvfval.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| nvinvfval.3 | ⊢ 𝑁 = (𝑆 ∘ ◡(2nd ↾ ({-1} × V))) |
| Ref | Expression |
|---|---|
| nvinvfval | ⊢ (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . . . 5 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈) | |
| 2 | nvinvfval.4 | . . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 3 | 1, 2 | nvsf 31100 | . . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈)) |
| 4 | neg1cn 12227 | . . . 4 ⊢ -1 ∈ ℂ | |
| 5 | nvinvfval.3 | . . . . 5 ⊢ 𝑁 = (𝑆 ∘ ◡(2nd ↾ ({-1} × V))) | |
| 6 | 5 | curry1f 8103 | . . . 4 ⊢ ((𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈) ∧ -1 ∈ ℂ) → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈)) |
| 7 | 3, 4, 6 | sylancl 598 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝑁:(BaseSet‘𝑈)⟶(BaseSet‘𝑈)) |
| 8 | 7 | ffnd 6703 | . 2 ⊢ (𝑈 ∈ NrmCVec → 𝑁 Fn (BaseSet‘𝑈)) |
| 9 | nvinvfval.2 | . . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 10 | 9 | nvgrp 31098 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp) |
| 11 | 1, 9 | bafval 31085 | . . . 4 ⊢ (BaseSet‘𝑈) = ran 𝐺 |
| 12 | eqid 2760 | . . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺) | |
| 13 | 11, 12 | grpoinvf 31013 | . . 3 ⊢ (𝐺 ∈ GrpOp → (inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈)) |
| 14 | f1ofn 6818 | . . 3 ⊢ ((inv‘𝐺):(BaseSet‘𝑈)–1-1-onto→(BaseSet‘𝑈) → (inv‘𝐺) Fn (BaseSet‘𝑈)) | |
| 15 | 10, 13, 14 | 3syl 19 | . 2 ⊢ (𝑈 ∈ NrmCVec → (inv‘𝐺) Fn (BaseSet‘𝑈)) |
| 16 | 3 | ffnd 6703 | . . . . 5 ⊢ (𝑈 ∈ NrmCVec → 𝑆 Fn (ℂ × (BaseSet‘𝑈))) |
| 17 | 16 | adantr 486 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → 𝑆 Fn (ℂ × (BaseSet‘𝑈))) |
| 18 | 5 | curry1val 8102 | . . . 4 ⊢ ((𝑆 Fn (ℂ × (BaseSet‘𝑈)) ∧ -1 ∈ ℂ) → (𝑁‘𝑥) = (-1𝑆𝑥)) |
| 19 | 17, 4, 18 | sylancl 598 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁‘𝑥) = (-1𝑆𝑥)) |
| 20 | 1, 9, 2, 12 | nvinv 31120 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (-1𝑆𝑥) = ((inv‘𝐺)‘𝑥)) |
| 21 | 19, 20 | eqtrd 2795 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ (BaseSet‘𝑈)) → (𝑁‘𝑥) = ((inv‘𝐺)‘𝑥)) |
| 22 | 8, 15, 21 | eqfnfvd 7025 | 1 ⊢ (𝑈 ∈ NrmCVec → 𝑁 = (inv‘𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 {csn 4584 × cxp 5653 ◡ccnv 5654 ↾ cres 5657 ∘ ccom 5659 Fn wfn 6528 ⟶wf 6529 –1-1-onto→wf1o 6532 ‘cfv 6533 (class class class)co 7413 2nd c2nd 7985 ℂcc 11122 1c1 11125 -cneg 11466 GrpOpcgr 30970 invcgn 30972 NrmCVeccnv 31065 +𝑣 cpv 31066 BaseSetcba 31067 ·𝑠OLD cns 31068 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 |
| 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 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-ltxr 11272 df-sub 11467 df-neg 11468 df-grpo 30974 df-gid 30975 df-ginv 30976 df-ablo 31026 df-vc 31040 df-nv 31073 df-va 31076 df-ba 31077 df-sm 31078 df-0v 31079 df-nmcv 31081 |
| This theorem is used by: hhssabloilem 31742 |
| Copyright terms: Public domain | W3C validator |