Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > metss2 | Structured version Visualization version GIF version |
Description: If the metric 𝐷 is "strongly finer" than 𝐶 (meaning that there is a positive real constant 𝑅 such that 𝐶(𝑥, 𝑦) ≤ 𝑅 · 𝐷(𝑥, 𝑦)), then 𝐷 generates a finer topology. (Using this theorem twice in each direction states that if two metrics are strongly equivalent, then they generate the same topology.) (Contributed by Mario Carneiro, 14-Sep-2015.) |
Ref | Expression |
---|---|
metequiv.3 | ⊢ 𝐽 = (MetOpen‘𝐶) |
metequiv.4 | ⊢ 𝐾 = (MetOpen‘𝐷) |
metss2.1 | ⊢ (𝜑 → 𝐶 ∈ (Met‘𝑋)) |
metss2.2 | ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋)) |
metss2.3 | ⊢ (𝜑 → 𝑅 ∈ ℝ+) |
metss2.4 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ≤ (𝑅 · (𝑥𝐷𝑦))) |
Ref | Expression |
---|---|
metss2 | ⊢ (𝜑 → 𝐽 ⊆ 𝐾) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 488 | . . . . 5 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+) → 𝑟 ∈ ℝ+) | |
2 | metss2.3 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ+) | |
3 | rpdivcl 12455 | . . . . 5 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑅 ∈ ℝ+) → (𝑟 / 𝑅) ∈ ℝ+) | |
4 | 1, 2, 3 | syl2anr 599 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+)) → (𝑟 / 𝑅) ∈ ℝ+) |
5 | metequiv.3 | . . . . 5 ⊢ 𝐽 = (MetOpen‘𝐶) | |
6 | metequiv.4 | . . . . 5 ⊢ 𝐾 = (MetOpen‘𝐷) | |
7 | metss2.1 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ (Met‘𝑋)) | |
8 | metss2.2 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋)) | |
9 | metss2.4 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ≤ (𝑅 · (𝑥𝐷𝑦))) | |
10 | 5, 6, 7, 8, 2, 9 | metss2lem 23213 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟)) |
11 | oveq2 7158 | . . . . . 6 ⊢ (𝑠 = (𝑟 / 𝑅) → (𝑥(ball‘𝐷)𝑠) = (𝑥(ball‘𝐷)(𝑟 / 𝑅))) | |
12 | 11 | sseq1d 3923 | . . . . 5 ⊢ (𝑠 = (𝑟 / 𝑅) → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ↔ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))) |
13 | 12 | rspcev 3541 | . . . 4 ⊢ (((𝑟 / 𝑅) ∈ ℝ+ ∧ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟)) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)) |
14 | 4, 10, 13 | syl2anc 587 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+)) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)) |
15 | 14 | ralrimivva 3120 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ+ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)) |
16 | metxmet 23036 | . . . 4 ⊢ (𝐶 ∈ (Met‘𝑋) → 𝐶 ∈ (∞Met‘𝑋)) | |
17 | 7, 16 | syl 17 | . . 3 ⊢ (𝜑 → 𝐶 ∈ (∞Met‘𝑋)) |
18 | metxmet 23036 | . . . 4 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋)) | |
19 | 8, 18 | syl 17 | . . 3 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) |
20 | 5, 6 | metss 23210 | . . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽 ⊆ 𝐾 ↔ ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ+ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))) |
21 | 17, 19, 20 | syl2anc 587 | . 2 ⊢ (𝜑 → (𝐽 ⊆ 𝐾 ↔ ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ+ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))) |
22 | 15, 21 | mpbird 260 | 1 ⊢ (𝜑 → 𝐽 ⊆ 𝐾) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3070 ∃wrex 3071 ⊆ wss 3858 class class class wbr 5032 ‘cfv 6335 (class class class)co 7150 · cmul 10580 ≤ cle 10714 / cdiv 11335 ℝ+crp 12430 ∞Metcxmet 20151 Metcmet 20152 ballcbl 20153 MetOpencmopn 20156 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5169 ax-nul 5176 ax-pow 5234 ax-pr 5298 ax-un 7459 ax-cnex 10631 ax-resscn 10632 ax-1cn 10633 ax-icn 10634 ax-addcl 10635 ax-addrcl 10636 ax-mulcl 10637 ax-mulrcl 10638 ax-mulcom 10639 ax-addass 10640 ax-mulass 10641 ax-distr 10642 ax-i2m1 10643 ax-1ne0 10644 ax-1rid 10645 ax-rnegex 10646 ax-rrecex 10647 ax-cnre 10648 ax-pre-lttri 10649 ax-pre-lttrn 10650 ax-pre-ltadd 10651 ax-pre-mulgt0 10652 ax-pre-sup 10653 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-nel 3056 df-ral 3075 df-rex 3076 df-reu 3077 df-rmo 3078 df-rab 3079 df-v 3411 df-sbc 3697 df-csb 3806 df-dif 3861 df-un 3863 df-in 3865 df-ss 3875 df-pss 3877 df-nul 4226 df-if 4421 df-pw 4496 df-sn 4523 df-pr 4525 df-tp 4527 df-op 4529 df-uni 4799 df-iun 4885 df-br 5033 df-opab 5095 df-mpt 5113 df-tr 5139 df-id 5430 df-eprel 5435 df-po 5443 df-so 5444 df-fr 5483 df-we 5485 df-xp 5530 df-rel 5531 df-cnv 5532 df-co 5533 df-dm 5534 df-rn 5535 df-res 5536 df-ima 5537 df-pred 6126 df-ord 6172 df-on 6173 df-lim 6174 df-suc 6175 df-iota 6294 df-fun 6337 df-fn 6338 df-f 6339 df-f1 6340 df-fo 6341 df-f1o 6342 df-fv 6343 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7580 df-1st 7693 df-2nd 7694 df-wrecs 7957 df-recs 8018 df-rdg 8056 df-er 8299 df-map 8418 df-en 8528 df-dom 8529 df-sdom 8530 df-sup 8939 df-inf 8940 df-pnf 10715 df-mnf 10716 df-xr 10717 df-ltxr 10718 df-le 10719 df-sub 10910 df-neg 10911 df-div 11336 df-nn 11675 df-2 11737 df-n0 11935 df-z 12021 df-uz 12283 df-q 12389 df-rp 12431 df-xneg 12548 df-xadd 12549 df-xmul 12550 df-topgen 16775 df-psmet 20158 df-xmet 20159 df-met 20160 df-bl 20161 df-mopn 20162 df-bases 21646 |
This theorem is referenced by: equivcmet 24017 |
Copyright terms: Public domain | W3C validator |