cfil3i - Metamath Proof Explorer

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

Theorem cfil3i 24785

Description: A Cauchy filter contains balls of any pre-chosen size. (Contributed by Mario Carneiro, 15-Oct-2015.)

**Assertion**
Ref	Expression
cfil3i	⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑅) ∈ 𝐹)

Distinct variable groups: 𝑥,𝐹 𝑥,𝑋 𝑥,𝑅 𝑥,𝐷

Proof of Theorem cfil3i Dummy variables 𝑠 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cfili 24784	. . 3 ⊢ ((𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → ∃𝑠 ∈ 𝐹 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅)
2	1	3adant1 1130	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → ∃𝑠 ∈ 𝐹 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅)
3		cfilfil 24783	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) → 𝐹 ∈ (Fil‘𝑋))
4	3	3adant3 1132	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → 𝐹 ∈ (Fil‘𝑋))
5		fileln0 23353	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ≠ ∅)
6	4, 5	sylan 580	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → 𝑠 ≠ ∅)
7		r19.2z 4494	. . . . . 6 ⊢ ((𝑠 ≠ ∅ ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅) → ∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅)
8	7	ex 413	. . . . 5 ⊢ (𝑠 ≠ ∅ → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
9	6, 8	syl 17	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
10		filelss 23355	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
11	4, 10	sylan 580	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
12		ssrexv 4051	. . . . 5 ⊢ (𝑠 ⊆ 𝑋 → (∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
13	11, 12	syl 17	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
14		dfss3 3970	. . . . . . 7 ⊢ (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) ↔ ∀𝑦 ∈ 𝑠 𝑦 ∈ (𝑥(ball‘𝐷)𝑅))
15		simpl1 1191	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → 𝐷 ∈ (∞Met‘𝑋))
16	15	ad2antrr 724	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝐷 ∈ (∞Met‘𝑋))
17		simpll3 1214	. . . . . . . . . . 11 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ⁺)
18	17	rpxrd 13016	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ^*)
19	18	adantr 481	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝑅 ∈ ℝ^*)
20		simplr 767	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝑥 ∈ 𝑋)
21	11	adantr 481	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑠 ⊆ 𝑋)
22	21	sselda 3982	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝑦 ∈ 𝑋)
23		elbl2 23895	. . . . . . . . 9 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ^*) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑦 ∈ (𝑥(ball‘𝐷)𝑅) ↔ (𝑥𝐷𝑦) < 𝑅))
24	16, 19, 20, 22, 23	syl22anc 837	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → (𝑦 ∈ (𝑥(ball‘𝐷)𝑅) ↔ (𝑥𝐷𝑦) < 𝑅))
25	24	ralbidva 3175	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ 𝑠 𝑦 ∈ (𝑥(ball‘𝐷)𝑅) ↔ ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
26	14, 25	bitrid 282	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) ↔ ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
27	4	ad2antrr 724	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝐹 ∈ (Fil‘𝑋))
28		simplr 767	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑠 ∈ 𝐹)
29	15	adantr 481	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝐷 ∈ (∞Met‘𝑋))
30		simpr 485	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
31		blssm 23923	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → (𝑥(ball‘𝐷)𝑅) ⊆ 𝑋)
32	29, 30, 18, 31	syl3anc 1371	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (𝑥(ball‘𝐷)𝑅) ⊆ 𝑋)
33		filss 23356	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑠 ∈ 𝐹 ∧ (𝑥(ball‘𝐷)𝑅) ⊆ 𝑋 ∧ 𝑠 ⊆ (𝑥(ball‘𝐷)𝑅))) → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹)
34	33	3exp2 1354	. . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑠 ∈ 𝐹 → ((𝑥(ball‘𝐷)𝑅) ⊆ 𝑋 → (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))))
35	27, 28, 32, 34	syl3c 66	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
36	26, 35	sylbird 259	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
37	36	reximdva 3168	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
38	9, 13, 37	3syld 60	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
39	38	rexlimdva 3155	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → (∃𝑠 ∈ 𝐹 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
40	2, 39	mpd 15	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑅) ∈ 𝐹)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 ⊆ wss 3948 ∅c0 4322 class class class wbr 5148 ‘cfv 6543 (class class class)co 7408 ℝ^*cxr 11246 < clt 11247 ℝ⁺crp 12973 ∞Metcxmet 20928 ballcbl 20930 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-bl 20938 df-fbas 20940 df-fil 23349 df-cfil 24771

This theorem is referenced by: iscfil3 24789 cfilfcls 24790 relcmpcmet 24834

W3C validator