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

Theorem uffclsflim 22567
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.)
Assertion
Ref Expression
uffclsflim (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) = (𝐽 fLim 𝐹))

Proof of Theorem uffclsflim
Dummy variables 𝑥 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ufilfil 22440 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
2 fclsfnflim 22563 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑓 ∈ (Fil‘𝑋)(𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓))))
31, 2syl 17 . . . . . 6 (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑓 ∈ (Fil‘𝑋)(𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓))))
43biimpa 477 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) → ∃𝑓 ∈ (Fil‘𝑋)(𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))
5 simprrr 778 . . . . . 6 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑥 ∈ (𝐽 fLim 𝑓))
6 simpll 763 . . . . . . . 8 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 ∈ (UFil‘𝑋))
7 simprl 767 . . . . . . . 8 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑓 ∈ (Fil‘𝑋))
8 simprrl 777 . . . . . . . 8 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹𝑓)
9 ufilmax 22443 . . . . . . . 8 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓) → 𝐹 = 𝑓)
106, 7, 8, 9syl3anc 1363 . . . . . . 7 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 = 𝑓)
1110oveq2d 7161 . . . . . 6 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → (𝐽 fLim 𝐹) = (𝐽 fLim 𝑓))
125, 11eleqtrrd 2913 . . . . 5 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑥 ∈ (𝐽 fLim 𝐹))
134, 12rexlimddv 3288 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) → 𝑥 ∈ (𝐽 fLim 𝐹))
1413ex 413 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) → 𝑥 ∈ (𝐽 fLim 𝐹)))
1514ssrdv 3970 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) ⊆ (𝐽 fLim 𝐹))
16 flimfcls 22562 . . 3 (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹)
1716a1i 11 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹))
1815, 17eqssd 3981 1 (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) = (𝐽 fLim 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1528  wcel 2105  wrex 3136  wss 3933  cfv 6348  (class class class)co 7145  Filcfil 22381  UFilcufil 22435   fLim cflim 22470   fClus cfcls 22472
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-nel 3121  df-ral 3140  df-rex 3141  df-reu 3142  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-pss 3951  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4831  df-int 4868  df-iun 4912  df-iin 4913  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-ov 7148  df-oprab 7149  df-mpo 7150  df-om 7570  df-wrecs 7936  df-recs 7997  df-rdg 8035  df-1o 8091  df-oadd 8095  df-er 8278  df-en 8498  df-fin 8501  df-fi 8863  df-fbas 20470  df-fg 20471  df-top 21430  df-topon 21447  df-cld 21555  df-ntr 21556  df-cls 21557  df-nei 21634  df-fil 22382  df-ufil 22437  df-flim 22475  df-fcls 22477
This theorem is referenced by:  ufilcmp  22568  uffcfflf  22575
  Copyright terms: Public domain W3C validator