Theorem uffclsflim 23925

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.

Step	Hyp	Ref	Expression
1		ufilfil 23798	. . . . . . 7 ⊢ (𝐹 ∈ (UFil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
2		fclsfnflim 23921	. . . . . . 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 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 23801	. . . . . . . 8 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓) → 𝐹 = 𝑓)
10	6, 7, 8, 9	syl3anc 1373	. . . . . . 7 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝐹 = 𝑓)
11	10	oveq2d 7406	. . . . . 6 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → (𝐽 fLim 𝐹) = (𝐽 fLim 𝑓))
12	5, 11	eleqtrrd 2832	. . . . 5 ⊢ (((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ (𝐹 ⊆ 𝑓 ∧ 𝑥 ∈ (𝐽 fLim 𝑓)))) → 𝑥 ∈ (𝐽 fLim 𝐹))
13	4, 12	rexlimddv 3141	. . . 4 ⊢ ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 ∈ (𝐽 fClus 𝐹)) → 𝑥 ∈ (𝐽 fLim 𝐹))
14	13	ex 412	. . 3 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝑥 ∈ (𝐽 fClus 𝐹) → 𝑥 ∈ (𝐽 fLim 𝐹)))
15	14	ssrdv 3955	. 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) ⊆ (𝐽 fLim 𝐹))
16		flimfcls 23920	. . 3 ⊢ (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹)
17	16	a1i 11	. 2 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 fLim 𝐹) ⊆ (𝐽 fClus 𝐹))
18	15, 17	eqssd 3967	1 ⊢ (𝐹 ∈ (UFil‘𝑋) → (𝐽 fClus 𝐹) = (𝐽 fLim 𝐹))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃wrex 3054   ⊆ wss 3917  ‘cfv 6514  (class class class)co 7390  Filcfil 23739  UFilcufil 23793   fLim cflim 23828   fClus cfcls 23830

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-iun 4960  df-iin 4961  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1o 8437  df-2o 8438  df-en 8922  df-fin 8925  df-fi 9369  df-fbas 21268  df-fg 21269  df-top 22788  df-topon 22805  df-cld 22913  df-ntr 22914  df-cls 22915  df-nei 22992  df-fil 23740  df-ufil 23795  df-flim 23833  df-fcls 23835

This theorem is referenced by:  ufilcmp  23926  uffcfflf  23933