equivcfil - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > equivcfil		Structured version Visualization version GIF version

Theorem equivcfil 24816

Description: If the metric 𝐷 is "strongly finer" than 𝐶 (meaning that there is a positive real constant 𝑅 such that 𝐶(𝑥, 𝑦) ≤ 𝑅 · 𝐷(𝑥, 𝑦)), all the 𝐷-Cauchy filters are also 𝐶-Cauchy. (Using this theorem twice in each direction states that if two metrics are strongly equivalent, then they have the same Cauchy sequences.) (Contributed by Mario Carneiro, 14-Sep-2015.)

**Hypotheses**
Ref	Expression
equivcau.1	⊢ (𝜑 → 𝐶 ∈ (Met‘𝑋))
equivcau.2	⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
equivcau.3	⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
equivcau.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ≤ (𝑅 · (𝑥𝐷𝑦)))

**Assertion**
Ref	Expression
equivcfil	⊢ (𝜑 → (CauFil‘𝐷) ⊆ (CauFil‘𝐶))

Distinct variable groups: 𝑥,𝑦,𝐶 𝑥,𝐷,𝑦 𝜑,𝑥,𝑦 𝑥,𝑅,𝑦 𝑥,𝑋,𝑦

Proof of Theorem equivcfil Dummy variables 𝑓 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 486	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → 𝑟 ∈ ℝ⁺)
2		equivcau.3	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
3	2	ad2antrr 725	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → 𝑅 ∈ ℝ⁺)
4	1, 3	rpdivcld 13033	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (𝑟 / 𝑅) ∈ ℝ⁺)
5		oveq2 7417	. . . . . . . . . 10 ⊢ (𝑠 = (𝑟 / 𝑅) → (𝑥(ball‘𝐷)𝑠) = (𝑥(ball‘𝐷)(𝑟 / 𝑅)))
6	5	eleq1d 2819	. . . . . . . . 9 ⊢ (𝑠 = (𝑟 / 𝑅) → ((𝑥(ball‘𝐷)𝑠) ∈ 𝑓 ↔ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
7	6	rexbidv 3179	. . . . . . . 8 ⊢ (𝑠 = (𝑟 / 𝑅) → (∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 ↔ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
8	7	rspcv 3609	. . . . . . 7 ⊢ ((𝑟 / 𝑅) ∈ ℝ⁺ → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
9	4, 8	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
10		simpllr 775	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝑓 ∈ (Fil‘𝑋))
11		eqid 2733	. . . . . . . . . . . 12 ⊢ (MetOpen‘𝐶) = (MetOpen‘𝐶)
12		eqid 2733	. . . . . . . . . . . 12 ⊢ (MetOpen‘𝐷) = (MetOpen‘𝐷)
13		equivcau.1	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐶 ∈ (Met‘𝑋))
14		equivcau.2	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
15		equivcau.4	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ≤ (𝑅 · (𝑥𝐷𝑦)))
16	11, 12, 13, 14, 2, 15	metss2lem 24020	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
17	16	ancom2s 649	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ⁺ ∧ 𝑥 ∈ 𝑋)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
18	17	adantlr 714	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ (𝑟 ∈ ℝ⁺ ∧ 𝑥 ∈ 𝑋)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
19	18	anassrs 469	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
20	13	ad3antrrr 729	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ (Met‘𝑋))
21		metxmet 23840	. . . . . . . . . 10 ⊢ (𝐶 ∈ (Met‘𝑋) → 𝐶 ∈ (∞Met‘𝑋))
22	20, 21	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ (∞Met‘𝑋))
23		simpr 486	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
24		rpxr 12983	. . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ^*)
25	24	ad2antlr 726	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝑟 ∈ ℝ^*)
26		blssm 23924	. . . . . . . . 9 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ^*) → (𝑥(ball‘𝐶)𝑟) ⊆ 𝑋)
27	22, 23, 25, 26	syl3anc 1372	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → (𝑥(ball‘𝐶)𝑟) ⊆ 𝑋)
28		filss 23357	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (Fil‘𝑋) ∧ ((𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓 ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑋 ∧ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))) → (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)
29	28	3exp2 1355	. . . . . . . . 9 ⊢ (𝑓 ∈ (Fil‘𝑋) → ((𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓 → ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑋 → ((𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))))
30	29	com24 95	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘𝑋) → ((𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟) → ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑋 → ((𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓 → (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))))
31	10, 19, 27, 30	syl3c 66	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → ((𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓 → (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))
32	31	reximdva 3169	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))
33	9, 32	syld 47	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))
34	33	ralrimdva 3155	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))
35	34	imdistanda 573	. . 3 ⊢ (𝜑 → ((𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓) → (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)))
36		metxmet 23840	. . . 4 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
37		iscfil3 24790	. . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝑓 ∈ (CauFil‘𝐷) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓)))
38	14, 36, 37	3syl 18	. . 3 ⊢ (𝜑 → (𝑓 ∈ (CauFil‘𝐷) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓)))
39		iscfil3 24790	. . . 4 ⊢ (𝐶 ∈ (∞Met‘𝑋) → (𝑓 ∈ (CauFil‘𝐶) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)))
40	13, 21, 39	3syl 18	. . 3 ⊢ (𝜑 → (𝑓 ∈ (CauFil‘𝐶) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)))
41	35, 38, 40	3imtr4d 294	. 2 ⊢ (𝜑 → (𝑓 ∈ (CauFil‘𝐷) → 𝑓 ∈ (CauFil‘𝐶)))
42	41	ssrdv 3989	1 ⊢ (𝜑 → (CauFil‘𝐷) ⊆ (CauFil‘𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 ⊆ wss 3949 class class class wbr 5149 ‘cfv 6544 (class class class)co 7409 · cmul 11115 ℝ^*cxr 11247 ≤ cle 11249 / cdiv 11871 ℝ⁺crp 12974 ∞Metcxmet 20929 Metcmet 20930 ballcbl 20931 MetOpencmopn 20934 Filcfil 23349 CauFilccfil 24769

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-po 5589 df-so 5590 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-2 12275 df-rp 12975 df-xneg 13092 df-xadd 13093 df-xmul 13094 df-ico 13330 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-fbas 20941 df-fil 23350 df-cfil 24772

This theorem is referenced by: equivcmet 24834

W3C validator