| 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 31141 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (normCV‘𝑈):𝑋⟶ℝ) |
| 4 | eqid 2760 | . . . 4 ⊢ ( −𝑣 ‘𝑈) = ( −𝑣 ‘𝑈) | |
| 5 | 1, 4 | nvmf 31126 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) |
| 6 | fco 6727 | . . 3 ⊢ (((normCV‘𝑈):𝑋⟶ℝ ∧ ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) | |
| 7 | 3, 5, 6 | syl2anc 596 | . 2 ⊢ (𝑈 ∈ NrmCVec → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) |
| 8 | imsdfn.8 | . . . 4 ⊢ 𝐷 = (IndMet‘𝑈) | |
| 9 | 4, 2, 8 | imsval 31166 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐷 = ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈))) |
| 10 | 9 | feq1d 6684 | . 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 1570 ∈ wcel 2145 × cxp 5653 ∘ ccom 5659 ⟶wf 6529 ‘cfv 6533 ℝcr 11123 NrmCVeccnv 31065 BaseSetcba 31067 −𝑣 cnsb 31070 normCVcnmcv 31071 IndMetcims 31072 |
| 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-gdiv 30977 df-ablo 31026 df-vc 31040 df-nv 31073 df-va 31076 df-ba 31077 df-sm 31078 df-0v 31079 df-vs 31080 df-nmcv 31081 df-ims 31082 |
| This theorem is used by: imsmetlem 31171 sspims 31220 |
| Copyright terms: Public domain | W3C validator |