| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > imsdf | Structured version Visualization version GIF version | ||
| Description: Mapping for the induced metric distance function of a normed complex vector space. (Contributed by NM, 29-Nov-2006.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| imsdfn.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| imsdfn.8 | ⊢ 𝐷 = (IndMet‘𝑈) |
| Ref | Expression |
|---|---|
| imsdf | ⊢ (𝑈 ∈ NrmCVec → 𝐷:(𝑋 × 𝑋)⟶ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imsdfn.1 | . . . 4 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | eqid 2760 | . . . 4 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 3 | 1, 2 | nvf 31268 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (normCV‘𝑈):𝑋⟶ℝ) |
| 4 | eqid 2760 | . . . 4 ⊢ ( −𝑣 ‘𝑈) = ( −𝑣 ‘𝑈) | |
| 5 | 1, 4 | nvmf 31253 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) |
| 6 | fco 6735 | . . 3 ⊢ (((normCV‘𝑈):𝑋⟶ℝ ∧ ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) | |
| 7 | 3, 5, 6 | syl2anc 596 | . 2 ⊢ (𝑈 ∈ NrmCVec → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) |
| 8 | imsdfn.8 | . . . 4 ⊢ 𝐷 = (IndMet‘𝑈) | |
| 9 | 4, 2, 8 | imsval 31293 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐷 = ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈))) |
| 10 | 9 | feq1d 6692 | . 2 ⊢ (𝑈 ∈ NrmCVec → (𝐷:(𝑋 × 𝑋)⟶ℝ ↔ ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ)) |
| 11 | 7, 10 | mpbird 260 | 1 ⊢ (𝑈 ∈ NrmCVec → 𝐷:(𝑋 × 𝑋)⟶ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 × cxp 5648 ∘ ccom 5654 ⟶wf 6535 ‘cfv 6539 ℝcr 11203 NrmCVeccnv 31192 BaseSetcba 31194 −𝑣 cnsb 31197 normCVcnmcv 31198 IndMetcims 31199 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-1st 8002 df-2nd 8003 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-ltxr 11352 df-sub 11547 df-neg 11548 df-grpo 31101 df-gid 31102 df-ginv 31103 df-gdiv 31104 df-ablo 31153 df-vc 31167 df-nv 31200 df-va 31203 df-ba 31204 df-sm 31205 df-0v 31206 df-vs 31207 df-nmcv 31208 df-ims 31209 |
| This theorem is used by: imsmetlem 31298 sspims 31347 |
| Copyright terms: Public domain | W3C validator |