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 24815

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 485	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → 𝑟 ∈ ℝ⁺)
2		equivcau.3	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
3	2	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → 𝑅 ∈ ℝ⁺)
4	1, 3	rpdivcld 13032	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (𝑟 / 𝑅) ∈ ℝ⁺)
5		oveq2 7416	. . . . . . . . . 10 ⊢ (𝑠 = (𝑟 / 𝑅) → (𝑥(ball‘𝐷)𝑠) = (𝑥(ball‘𝐷)(𝑟 / 𝑅)))
6	5	eleq1d 2818	. . . . . . . . 9 ⊢ (𝑠 = (𝑟 / 𝑅) → ((𝑥(ball‘𝐷)𝑠) ∈ 𝑓 ↔ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
7	6	rexbidv 3178	. . . . . . . 8 ⊢ (𝑠 = (𝑟 / 𝑅) → (∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 ↔ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
8	7	rspcv 3608	. . . . . . 7 ⊢ ((𝑟 / 𝑅) ∈ ℝ⁺ → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
9	4, 8	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓))
10		simpllr 774	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝑓 ∈ (Fil‘𝑋))
11		eqid 2732	. . . . . . . . . . . 12 ⊢ (MetOpen‘𝐶) = (MetOpen‘𝐶)
12		eqid 2732	. . . . . . . . . . . 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 24019	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ⁺)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
17	16	ancom2s 648	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ⁺ ∧ 𝑥 ∈ 𝑋)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
18	17	adantlr 713	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ (𝑟 ∈ ℝ⁺ ∧ 𝑥 ∈ 𝑋)) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
19	18	anassrs 468	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))
20	13	ad3antrrr 728	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ (Met‘𝑋))
21		metxmet 23839	. . . . . . . . . 10 ⊢ (𝐶 ∈ (Met‘𝑋) → 𝐶 ∈ (∞Met‘𝑋))
22	20, 21	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ (∞Met‘𝑋))
23		simpr 485	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
24		rpxr 12982	. . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ^*)
25	24	ad2antlr 725	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → 𝑟 ∈ ℝ^*)
26		blssm 23923	. . . . . . . . 9 ⊢ ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ^*) → (𝑥(ball‘𝐶)𝑟) ⊆ 𝑋)
27	22, 23, 25, 26	syl3anc 1371	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) ∧ 𝑥 ∈ 𝑋) → (𝑥(ball‘𝐶)𝑟) ⊆ 𝑋)
28		filss 23356	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (Fil‘𝑋) ∧ ((𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓 ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑋 ∧ (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ⊆ (𝑥(ball‘𝐶)𝑟))) → (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)
29	28	3exp2 1354	. . . . . . . . 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 3168	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)(𝑟 / 𝑅)) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))
33	9, 32	syld 47	. . . . 5 ⊢ (((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) ∧ 𝑟 ∈ ℝ⁺) → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))
34	33	ralrimdva 3154	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (Fil‘𝑋)) → (∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓 → ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓))
35	34	imdistanda 572	. . 3 ⊢ (𝜑 → ((𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓) → (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)))
36		metxmet 23839	. . . 4 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
37		iscfil3 24789	. . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝑓 ∈ (CauFil‘𝐷) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓)))
38	14, 36, 37	3syl 18	. . 3 ⊢ (𝜑 → (𝑓 ∈ (CauFil‘𝐷) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑠 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑠) ∈ 𝑓)))
39		iscfil3 24789	. . . 4 ⊢ (𝐶 ∈ (∞Met‘𝑋) → (𝑓 ∈ (CauFil‘𝐶) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)))
40	13, 21, 39	3syl 18	. . 3 ⊢ (𝜑 → (𝑓 ∈ (CauFil‘𝐶) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀𝑟 ∈ ℝ⁺ ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐶)𝑟) ∈ 𝑓)))
41	35, 38, 40	3imtr4d 293	. 2 ⊢ (𝜑 → (𝑓 ∈ (CauFil‘𝐷) → 𝑓 ∈ (CauFil‘𝐶)))
42	41	ssrdv 3988	1 ⊢ (𝜑 → (CauFil‘𝐷) ⊆ (CauFil‘𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ⊆ wss 3948 class class class wbr 5148 ‘cfv 6543 (class class class)co 7408 · cmul 11114 ℝ^*cxr 11246 ≤ cle 11248 / cdiv 11870 ℝ⁺crp 12973 ∞Metcxmet 20928 Metcmet 20929 ballcbl 20930 MetOpencmopn 20933 Filcfil 23348 CauFilccfil 24768

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 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-po 5588 df-so 5589 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7974 df-2nd 7975 df-er 8702 df-map 8821 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-div 11871 df-2 12274 df-rp 12974 df-xneg 13091 df-xadd 13092 df-xmul 13093 df-ico 13329 df-psmet 20935 df-xmet 20936 df-met 20937 df-bl 20938 df-fbas 20940 df-fil 23349 df-cfil 24771

This theorem is referenced by: equivcmet 24833

W3C validator