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

Theorem uffcfflf 24014
Description: If the domain filter is an ultrafilter, the cluster points of the function are the limit points. (Contributed by Jeff Hankins, 12-Dec-2009.) (Revised by Stefan O'Rear, 9-Aug-2015.)
Assertion
Ref Expression
uffcfflf ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = ((𝐽 fLimf 𝐿)‘𝐹))

Proof of Theorem uffcfflf
StepHypRef Expression
1 toponmax 22901 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
2 fmufil 23934 . . . 4 ((𝑋𝐽𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋))
31, 2syl3an1 1164 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋))
4 uffclsflim 24006 . . 3 (((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋) → (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
53, 4syl 17 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
6 ufilfil 23879 . . 3 (𝐿 ∈ (UFil‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
7 fcfval 24008 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)))
86, 7syl3an2 1165 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)))
9 flfval 23965 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
106, 9syl3an2 1165 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
115, 8, 103eqtr4d 2782 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = ((𝐽 fLimf 𝐿)‘𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1087   = wceq 1542  wcel 2114  wf 6488  cfv 6492  (class class class)co 7360  TopOnctopon 22885  Filcfil 23820  UFilcufil 23874   FilMap cfm 23908   fLim cflim 23909   fLimf cflf 23910   fClus cfcls 23911   fClusf cfcf 23912
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1o 8398  df-2o 8399  df-map 8768  df-en 8887  df-fin 8890  df-fi 9317  df-fbas 21341  df-fg 21342  df-top 22869  df-topon 22886  df-cld 22994  df-ntr 22995  df-cls 22996  df-nei 23073  df-fil 23821  df-ufil 23876  df-fm 23913  df-flim 23914  df-flf 23915  df-fcls 23916  df-fcf 23917
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator