| 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 2763 | . . . 4 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 3 | 1, 2 | nvf 31319 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (normCV‘𝑈):𝑋⟶ℝ) |
| 4 | eqid 2763 | . . . 4 ⊢ ( −𝑣 ‘𝑈) = ( −𝑣 ‘𝑈) | |
| 5 | 1, 4 | nvmf 31304 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) |
| 6 | fco 6764 | . . 3 ⊢ (((normCV‘𝑈):𝑋⟶ℝ ∧ ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) | |
| 7 | 3, 5, 6 | syl2anc 596 | . 2 ⊢ (𝑈 ∈ NrmCVec → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) |
| 8 | imsdfn.8 | . . . 4 ⊢ 𝐷 = (IndMet‘𝑈) | |
| 9 | 4, 2, 8 | imsval 31344 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐷 = ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈))) |
| 10 | 9 | feq1d 6721 | . 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 2147 × cxp 5656 ∘ ccom 5662 ⟶wf 6562 ‘cfv 6566 ℝcr 11238 NrmCVeccnv 31243 BaseSetcba 31245 −𝑣 cnsb 31248 normCVcnmcv 31249 IndMetcims 31250 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 df-sub 11582 df-neg 11583 df-grpo 31152 df-gid 31153 df-ginv 31154 df-gdiv 31155 df-ablo 31204 df-vc 31218 df-nv 31251 df-va 31254 df-ba 31255 df-sm 31256 df-0v 31257 df-vs 31258 df-nmcv 31259 df-ims 31260 |
| This theorem is used by: imsmetlem 31349 sspims 31398 |
| Copyright terms: Public domain | W3C validator |