![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > metss2 | 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 110 | . . . . 5 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+) → 𝑟 ∈ ℝ+) | |
2 | metss2.3 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ+) | |
3 | rpdivcl 9708 | . . . . 5 ⊢ ((𝑟 ∈ ℝ+ ∧ 𝑅 ∈ ℝ+) → (𝑟 / 𝑅) ∈ ℝ+) | |
4 | 1, 2, 3 | syl2anr 290 | . . . 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 14449 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟)) |
11 | oveq2 5903 | . . . . . 6 ⊢ (𝑠 = (𝑟 / 𝑅) → (𝑥(ball‘𝐷)𝑠) = (𝑥(ball‘𝐷)(𝑟 / 𝑅))) | |
12 | 11 | sseq1d 3199 | . . . . 5 ⊢ (𝑠 = (𝑟 / 𝑅) → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ↔ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))) |
13 | 12 | rspcev 2856 | . . . 4 ⊢ (((𝑟 / 𝑅) ∈ ℝ+ ∧ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟)) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)) |
14 | 4, 10, 13 | syl2anc 411 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+)) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)) |
15 | 14 | ralrimivva 2572 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ+ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)) |
16 | metxmet 14307 | . . . 4 ⊢ (𝐶 ∈ (Met‘𝑋) → 𝐶 ∈ (∞Met‘𝑋)) | |
17 | 7, 16 | syl 14 | . . 3 ⊢ (𝜑 → 𝐶 ∈ (∞Met‘𝑋)) |
18 | metxmet 14307 | . . . 4 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋)) | |
19 | 8, 18 | syl 14 | . . 3 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋)) |
20 | 5, 6 | metss 14446 | . . 3 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽 ⊆ 𝐾 ↔ ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ+ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))) |
21 | 17, 19, 20 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝐽 ⊆ 𝐾 ↔ ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ+ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))) |
22 | 15, 21 | mpbird 167 | 1 ⊢ (𝜑 → 𝐽 ⊆ 𝐾) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2160 ∀wral 2468 ∃wrex 2469 ⊆ wss 3144 class class class wbr 4018 ‘cfv 5235 (class class class)co 5895 · cmul 7845 ≤ cle 8022 / cdiv 8658 ℝ+crp 9682 ∞Metcxmet 13846 Metcmet 13847 ballcbl 13848 MetOpencmopn 13851 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-iinf 4605 ax-cnex 7931 ax-resscn 7932 ax-1cn 7933 ax-1re 7934 ax-icn 7935 ax-addcl 7936 ax-addrcl 7937 ax-mulcl 7938 ax-mulrcl 7939 ax-addcom 7940 ax-mulcom 7941 ax-addass 7942 ax-mulass 7943 ax-distr 7944 ax-i2m1 7945 ax-0lt1 7946 ax-1rid 7947 ax-0id 7948 ax-rnegex 7949 ax-precex 7950 ax-cnre 7951 ax-pre-ltirr 7952 ax-pre-ltwlin 7953 ax-pre-lttrn 7954 ax-pre-apti 7955 ax-pre-ltadd 7956 ax-pre-mulgt0 7957 ax-pre-mulext 7958 ax-arch 7959 ax-caucvg 7960 |
This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-if 3550 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-id 4311 df-po 4314 df-iso 4315 df-iord 4384 df-on 4386 df-ilim 4387 df-suc 4389 df-iom 4608 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-isom 5244 df-riota 5851 df-ov 5898 df-oprab 5899 df-mpo 5900 df-1st 6164 df-2nd 6165 df-recs 6329 df-frec 6415 df-map 6675 df-sup 7012 df-inf 7013 df-pnf 8023 df-mnf 8024 df-xr 8025 df-ltxr 8026 df-le 8027 df-sub 8159 df-neg 8160 df-reap 8561 df-ap 8568 df-div 8659 df-inn 8949 df-2 9007 df-3 9008 df-4 9009 df-n0 9206 df-z 9283 df-uz 9558 df-q 9649 df-rp 9683 df-xneg 9801 df-xadd 9802 df-seqfrec 10476 df-exp 10550 df-cj 10882 df-re 10883 df-im 10884 df-rsqrt 11038 df-abs 11039 df-topgen 12762 df-psmet 13853 df-xmet 13854 df-met 13855 df-bl 13856 df-mopn 13857 df-top 13950 df-bases 13995 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |