| 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 30604 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐺 ∈ GrpOp) |
| 3 | nvmval.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 4 | 3, 1 | bafval 30591 | . . . 4 ⊢ 𝑋 = ran 𝐺 |
| 5 | eqid 2731 | . . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺) | |
| 6 | nvmval.3 | . . . . 5 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 7 | 1, 6 | vsfval 30620 | . . . 4 ⊢ 𝑀 = ( /𝑔 ‘𝐺) |
| 8 | 4, 5, 7 | grpodivfval 30521 | . . 3 ⊢ (𝐺 ∈ GrpOp → 𝑀 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))) |
| 9 | 2, 8 | syl 17 | . 2 ⊢ (𝑈 ∈ NrmCVec → 𝑀 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))) |
| 10 | nvmval.4 | . . . . . 6 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 11 | 3, 1, 10, 5 | nvinv 30626 | . . . . 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 2769 | 1 ⊢ (𝑈 ∈ NrmCVec → 𝑀 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(-1𝑆𝑦)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ‘cfv 6487 (class class class)co 7352 ∈ cmpo 7354 1c1 11013 -cneg 11351 GrpOpcgr 30476 invcgn 30478 NrmCVeccnv 30571 +𝑣 cpv 30572 BaseSetcba 30573 ·𝑠OLD cns 30574 −𝑣 cnsb 30576 |
| 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-gdiv 30483 df-ablo 30532 df-vc 30546 df-nv 30579 df-va 30582 df-ba 30583 df-sm 30584 df-0v 30585 df-vs 30586 df-nmcv 30587 |
| This theorem is referenced by: nvmf 30632 cnnvm 30669 vmcn 30686 h2hvs 30964 |
| Copyright terms: Public domain | W3C validator |