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 25141

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 25140	. . 3 ⊢ ((𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → ∃𝑠 ∈ 𝐹 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅)
2	1	3adant1 1127	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → ∃𝑠 ∈ 𝐹 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅)
3		cfilfil 25139	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) → 𝐹 ∈ (Fil‘𝑋))
4	3	3adant3 1129	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) → 𝐹 ∈ (Fil‘𝑋))
5		fileln0 23698	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ≠ ∅)
6	4, 5	sylan 579	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → 𝑠 ≠ ∅)
7		r19.2z 4487	. . . . . 6 ⊢ ((𝑠 ≠ ∅ ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅) → ∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅)
8	7	ex 412	. . . . 5 ⊢ (𝑠 ≠ ∅ → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
9	6, 8	syl 17	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
10		filelss 23700	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
11	4, 10	sylan 579	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
12		ssrexv 4044	. . . . 5 ⊢ (𝑠 ⊆ 𝑋 → (∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
13	11, 12	syl 17	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∃𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
14		dfss3 3963	. . . . . . 7 ⊢ (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) ↔ ∀𝑦 ∈ 𝑠 𝑦 ∈ (𝑥(ball‘𝐷)𝑅))
15		simpl1 1188	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → 𝐷 ∈ (∞Met‘𝑋))
16	15	ad2antrr 723	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝐷 ∈ (∞Met‘𝑋))
17		simpll3 1211	. . . . . . . . . . 11 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ⁺)
18	17	rpxrd 13018	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ^*)
19	18	adantr 480	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝑅 ∈ ℝ^*)
20		simplr 766	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝑥 ∈ 𝑋)
21	11	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑠 ⊆ 𝑋)
22	21	sselda 3975	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → 𝑦 ∈ 𝑋)
23		elbl2 24240	. . . . . . . . 9 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ^*) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑦 ∈ (𝑥(ball‘𝐷)𝑅) ↔ (𝑥𝐷𝑦) < 𝑅))
24	16, 19, 20, 22, 23	syl22anc 836	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑠) → (𝑦 ∈ (𝑥(ball‘𝐷)𝑅) ↔ (𝑥𝐷𝑦) < 𝑅))
25	24	ralbidva 3167	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ 𝑠 𝑦 ∈ (𝑥(ball‘𝐷)𝑅) ↔ ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
26	14, 25	bitrid 283	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) ↔ ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅))
27	4	ad2antrr 723	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝐹 ∈ (Fil‘𝑋))
28		simplr 766	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑠 ∈ 𝐹)
29	15	adantr 480	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝐷 ∈ (∞Met‘𝑋))
30		simpr 484	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
31		blssm 24268	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → (𝑥(ball‘𝐷)𝑅) ⊆ 𝑋)
32	29, 30, 18, 31	syl3anc 1368	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (𝑥(ball‘𝐷)𝑅) ⊆ 𝑋)
33		filss 23701	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑠 ∈ 𝐹 ∧ (𝑥(ball‘𝐷)𝑅) ⊆ 𝑋 ∧ 𝑠 ⊆ (𝑥(ball‘𝐷)𝑅))) → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹)
34	33	3exp2 1351	. . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑠 ∈ 𝐹 → ((𝑥(ball‘𝐷)𝑅) ⊆ 𝑋 → (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))))
35	27, 28, 32, 34	syl3c 66	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (𝑠 ⊆ (𝑥(ball‘𝐷)𝑅) → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
36	26, 35	sylbird 260	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) ∧ 𝑥 ∈ 𝑋) → (∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
37	36	reximdva 3160	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
38	9, 13, 37	3syld 60	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷) ∧ 𝑅 ∈ ℝ⁺) ∧ 𝑠 ∈ 𝐹) → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥𝐷𝑦) < 𝑅 → ∃𝑥 ∈ 𝑋 (𝑥(ball‘𝐷)𝑅) ∈ 𝐹))
39	38	rexlimdva 3147	. 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 395 ∧ w3a 1084 ∈ wcel 2098 ≠ wne 2932 ∀wral 3053 ∃wrex 3062 ⊆ wss 3941 ∅c0 4315 class class class wbr 5139 ‘cfv 6534 (class class class)co 7402 ℝ^*cxr 11246 < clt 11247 ℝ⁺crp 12975 ∞Metcxmet 21219 ballcbl 21221 Filcfil 23693 CauFilccfil 25124

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-po 5579 df-so 5580 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-1st 7969 df-2nd 7970 df-er 8700 df-map 8819 df-en 8937 df-dom 8938 df-sdom 8939 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 12976 df-xneg 13093 df-xadd 13094 df-xmul 13095 df-ico 13331 df-psmet 21226 df-xmet 21227 df-bl 21229 df-fbas 21231 df-fil 23694 df-cfil 25127

This theorem is referenced by: iscfil3 25145 cfilfcls 25146 relcmpcmet 25190

W3C validator