| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvmfval | Structured version Visualization version GIF version | ||
| Description: Value of the function for the vector subtraction operation on a normed complex vector space. (Contributed by NM, 11-Sep-2007.) (Revised by Mario Carneiro, 23-Dec-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvmval.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nvmval.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| nvmval.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| nvmval.3 | ⊢ 𝑀 = ( −𝑣 ‘𝑈) |
| Ref | Expression |
|---|---|
| nvmfval | ⊢ (𝑈 ∈ NrmCVec → 𝑀 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(-1𝑆𝑦)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nvmval.2 | . . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 2 | 1 | nvgrp 30599 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp) |
| 3 | nvmval.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 4 | 3, 1 | bafval 30586 | . . . 4 ⊢ 𝑋 = ran 𝐺 |
| 5 | eqid 2733 | . . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺) | |
| 6 | nvmval.3 | . . . . 5 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 7 | 1, 6 | vsfval 30615 | . . . 4 ⊢ 𝑀 = ( /𝑔 ‘𝐺) |
| 8 | 4, 5, 7 | grpodivfval 30516 | . . 3 ⊢ (𝐺 ∈ GrpOp → 𝑀 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))) |
| 9 | 2, 8 | syl 17 | . 2 ⊢ (𝑈 ∈ NrmCVec → 𝑀 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))) |
| 10 | nvmval.4 | . . . . . 6 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 11 | 3, 1, 10, 5 | nvinv 30621 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑦 ∈ 𝑋) → (-1𝑆𝑦) = ((inv‘𝐺)‘𝑦)) |
| 12 | 11 | 3adant2 1131 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (-1𝑆𝑦) = ((inv‘𝐺)‘𝑦)) |
| 13 | 12 | oveq2d 7368 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐺(-1𝑆𝑦)) = (𝑥𝐺((inv‘𝐺)‘𝑦))) |
| 14 | 13 | mpoeq3dva 7429 | . 2 ⊢ (𝑈 ∈ NrmCVec → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(-1𝑆𝑦))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))) |
| 15 | 9, 14 | eqtr4d 2771 | 1 ⊢ (𝑈 ∈ NrmCVec → 𝑀 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(-1𝑆𝑦)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6486 (class class class)co 7352 ∈ cmpo 7354 1c1 11014 -cneg 11352 GrpOpcgr 30471 invcgn 30473 NrmCVeccnv 30566 +𝑣 cpv 30567 BaseSetcba 30568 ·𝑠OLD cns 30569 −𝑣 cnsb 30571 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 |
| 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 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 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 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 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 11155 df-mnf 11156 df-ltxr 11158 df-sub 11353 df-neg 11354 df-grpo 30475 df-gid 30476 df-ginv 30477 df-gdiv 30478 df-ablo 30527 df-vc 30541 df-nv 30574 df-va 30577 df-ba 30578 df-sm 30579 df-0v 30580 df-vs 30581 df-nmcv 30582 |
| This theorem is referenced by: nvmf 30627 cnnvm 30664 vmcn 30681 h2hvs 30959 |
| Copyright terms: Public domain | W3C validator |