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

Theorem uffclsflim 22639
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 22512 . . . . . . 7 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
2 fclsfnflim 22635 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑓 ∈ (Fil‘𝑋)(𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓))))
31, 2syl 17 . . . . . 6 (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∃𝑓 ∈ (Fil‘𝑋)(𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓))))
43biimpa 480 . . . . 5 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) → ∃𝑓 ∈ (Fil‘𝑋)(𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))
5 simprrr 781 . . . . . 6 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑥 ∈ (𝐽 fLim 𝑓))
6 simpll 766 . . . . . . . 8 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 ∈ (UFil‘𝑋))
7 simprl 770 . . . . . . . 8 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑓 ∈ (Fil‘𝑋))
8 simprrl 780 . . . . . . . 8 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹𝑓)
9 ufilmax 22515 . . . . . . . 8 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓) → 𝐹 = 𝑓)
106, 7, 8, 9syl3anc 1368 . . . . . . 7 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 = 𝑓)
1110oveq2d 7155 . . . . . 6 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → (𝐽 fLim 𝐹) = (𝐽 fLim 𝑓))
125, 11eleqtrrd 2896 . . . . 5 (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹𝑓𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑥 ∈ (𝐽 fLim 𝐹))
134, 12rexlimddv 3253 . . . 4 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) → 𝑥 ∈ (𝐽 fLim 𝐹))
1413ex 416 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) → 𝑥 ∈ (𝐽 fLim 𝐹)))
1514ssrdv 3924 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) ⊆ (𝐽 fLim 𝐹))
16 flimfcls 22634 . . 3 (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹)
1716a1i 11 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹))
1815, 17eqssd 3935 1 (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) = (𝐽 fLim 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2112  wrex 3110  wss 3884  cfv 6328  (class class class)co 7139  Filcfil 22453  UFilcufil 22507   fLim cflim 22542   fClus cfcls 22544
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-rep 5157  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-nel 3095  df-ral 3114  df-rex 3115  df-reu 3116  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3903  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-tp 4533  df-op 4535  df-uni 4804  df-int 4842  df-iun 4886  df-iin 4887  df-br 5034  df-opab 5096  df-mpt 5114  df-tr 5140  df-id 5428  df-eprel 5433  df-po 5442  df-so 5443  df-fr 5482  df-we 5484  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-pred 6120  df-ord 6166  df-on 6167  df-lim 6168  df-suc 6169  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-ov 7142  df-oprab 7143  df-mpo 7144  df-om 7565  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-1o 8089  df-oadd 8093  df-er 8276  df-en 8497  df-fin 8500  df-fi 8863  df-fbas 20091  df-fg 20092  df-top 21502  df-topon 21519  df-cld 21627  df-ntr 21628  df-cls 21629  df-nei 21706  df-fil 22454  df-ufil 22509  df-flim 22547  df-fcls 22549
This theorem is referenced by:  ufilcmp  22640  uffcfflf  22647
  Copyright terms: Public domain W3C validator