![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > uffclsflim | Structured version Visualization version GIF version |
Description: The cluster points of an ultrafilter are its limit points. (Contributed by Jeff Hankins, 11-Dec-2009.) (Revised by Mario Carneiro, 26-Aug-2015.) |
Ref | Expression |
---|---|
uffclsflim | ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) = (𝐽 fLim 𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ufilfil 23928 | . . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋)) | |
2 | fclsfnflim 24051 | . . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑓 ∈ (Fil‘𝑋)(𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) | |
3 | 1, 2 | syl 17 | . . . . . 6 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑓 ∈ (Fil‘𝑋)(𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) |
4 | 3 | biimpa 476 | . . . . 5 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) → ∃𝑓 ∈ (Fil‘𝑋)(𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓))) |
5 | simprrr 782 | . . . . . 6 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑥 ∈ (𝐽 fLim 𝑓)) | |
6 | simpll 767 | . . . . . . . 8 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 ∈ (UFil‘𝑋)) | |
7 | simprl 771 | . . . . . . . 8 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑓 ∈ (Fil‘𝑋)) | |
8 | simprrl 781 | . . . . . . . 8 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 ⊆ 𝑓) | |
9 | ufilmax 23931 | . . . . . . . 8 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓) → 𝐹 = 𝑓) | |
10 | 6, 7, 8, 9 | syl3anc 1370 | . . . . . . 7 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 = 𝑓) |
11 | 10 | oveq2d 7447 | . . . . . 6 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → (𝐽 fLim 𝐹) = (𝐽 fLim 𝑓)) |
12 | 5, 11 | eleqtrrd 2842 | . . . . 5 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑥 ∈ (𝐽 fLim 𝐹)) |
13 | 4, 12 | rexlimddv 3159 | . . . 4 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) → 𝑥 ∈ (𝐽 fLim 𝐹)) |
14 | 13 | ex 412 | . . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) → 𝑥 ∈ (𝐽 fLim 𝐹))) |
15 | 14 | ssrdv 4001 | . 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) ⊆ (𝐽 fLim 𝐹)) |
16 | flimfcls 24050 | . . 3 ⊢ (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹) | |
17 | 16 | a1i 11 | . 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹)) |
18 | 15, 17 | eqssd 4013 | 1 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) = (𝐽 fLim 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 ⊆ wss 3963 ‘cfv 6563 (class class class)co 7431 Filcfil 23869 UFilcufil 23923 fLim cflim 23958 fClus cfcls 23960 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1o 8505 df-2o 8506 df-en 8985 df-fin 8988 df-fi 9449 df-fbas 21379 df-fg 21380 df-top 22916 df-topon 22933 df-cld 23043 df-ntr 23044 df-cls 23045 df-nei 23122 df-fil 23870 df-ufil 23925 df-flim 23963 df-fcls 23965 |
This theorem is referenced by: ufilcmp 24056 uffcfflf 24063 |
Copyright terms: Public domain | W3C validator |