| 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 2765 | . . . 4 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 3 | 1, 2 | nvf 31059 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (normCV‘𝑈):𝑋⟶ℝ) |
| 4 | eqid 2765 | . . . 4 ⊢ ( −𝑣 ‘𝑈) = ( −𝑣 ‘𝑈) | |
| 5 | 1, 4 | nvmf 31044 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) |
| 6 | fco 6734 | . . 3 ⊢ (((normCV‘𝑈):𝑋⟶ℝ ∧ ( −𝑣 ‘𝑈):(𝑋 × 𝑋)⟶𝑋) → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) | |
| 7 | 3, 5, 6 | syl2anc 596 | . 2 ⊢ (𝑈 ∈ NrmCVec → ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈)):(𝑋 × 𝑋)⟶ℝ) |
| 8 | imsdfn.8 | . . . 4 ⊢ 𝐷 = (IndMet‘𝑈) | |
| 9 | 4, 2, 8 | imsval 31084 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐷 = ((normCV‘𝑈) ∘ ( −𝑣 ‘𝑈))) |
| 10 | 9 | feq1d 6691 | . 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 2146 × cxp 5661 ∘ ccom 5667 ⟶wf 6536 ‘cfv 6540 ℝcr 11110 NrmCVeccnv 30983 BaseSetcba 30985 −𝑣 cnsb 30988 normCVcnmcv 30989 IndMetcims 30990 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11256 df-mnf 11257 df-ltxr 11259 df-sub 11454 df-neg 11455 df-grpo 30892 df-gid 30893 df-ginv 30894 df-gdiv 30895 df-ablo 30944 df-vc 30958 df-nv 30991 df-va 30994 df-ba 30995 df-sm 30996 df-0v 30997 df-vs 30998 df-nmcv 30999 df-ims 31000 |
| This theorem is used by: imsmetlem 31089 sspims 31138 |
| Copyright terms: Public domain | W3C validator |