Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > metf | Structured version Visualization version GIF version |
Description: Mapping of the distance function of a metric space. (Contributed by NM, 30-Aug-2006.) |
Ref | Expression |
---|---|
metf | ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | metflem 23586 | . 2 ⊢ (𝐷 ∈ (Met‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦))))) | |
2 | 1 | simpld 496 | 1 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1541 ∈ wcel 2106 ∀wral 3062 class class class wbr 5096 × cxp 5622 ⟶wf 6479 ‘cfv 6483 (class class class)co 7341 ℝcr 10975 0cc0 10976 + caddc 10979 ≤ cle 11115 Metcmet 20688 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5247 ax-nul 5254 ax-pow 5312 ax-pr 5376 ax-un 7654 ax-cnex 11032 ax-resscn 11033 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3405 df-v 3444 df-sbc 3731 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4274 df-if 4478 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4857 df-br 5097 df-opab 5159 df-mpt 5180 df-id 5522 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6435 df-fun 6485 df-fn 6486 df-f 6487 df-fv 6491 df-ov 7344 df-oprab 7345 df-mpo 7346 df-map 8692 df-met 20696 |
This theorem is referenced by: metcl 23590 metn0 23618 metres2 23621 metres 23623 msf 23716 isngp3 23859 tngngp2 23921 tngngpim 23928 xrsdsre 24078 metdcn2 24107 cncms 24624 cnrrext 32256 isbnd3 36098 isbnd3b 36099 ssbnd 36102 bnd2lem 36105 prdsbnd 36107 |
Copyright terms: Public domain | W3C validator |