| 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 2761 | . . . 4 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 3 | 1, 2 | nvf 31255 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (normCV‘𝑈):𝑋⟶ℝ) |
| 4 | eqid 2761 | . . . 4 ⊢ ( −𝑣 ‘𝑈) = ( −𝑣 ‘𝑈) | |
| 5 | 1, 4 | nvmf 31240 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) |
| 6 | fco 6732 | . . 3 ⊢ (((normCV‘𝑈):𝑋⟶ℝ ∧ ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) | |
| 7 | 3, 5, 6 | syl2anc 596 | . 2 ⊢ (𝑈 ∈ NrmCVec → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) |
| 8 | imsdfn.8 | . . . 4 ⊢ 𝐷 = (IndMet‘𝑈) | |
| 9 | 4, 2, 8 | imsval 31280 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐷 = ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈))) |
| 10 | 9 | feq1d 6689 | . 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 5649 ∘ ccom 5655 ⟶wf 6533 ‘cfv 6537 ℝcr 11192 NrmCVeccnv 31179 BaseSetcba 31181 −𝑣 cnsb 31184 normCVcnmcv 31185 IndMetcims 31186 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-1st 7999 df-2nd 8000 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-ltxr 11341 df-sub 11536 df-neg 11537 df-grpo 31088 df-gid 31089 df-ginv 31090 df-gdiv 31091 df-ablo 31140 df-vc 31154 df-nv 31187 df-va 31190 df-ba 31191 df-sm 31192 df-0v 31193 df-vs 31194 df-nmcv 31195 df-ims 31196 |
| This theorem is used by: imsmetlem 31285 sspims 31334 |
| Copyright terms: Public domain | W3C validator |