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

Theorem uffcfflf 24227
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 23113 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
2 fmufil 24147 . . . 4 ((𝑋𝐽𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋))
31, 2syl3an1 1181 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋))
4 uffclsflim 24219 . . 3 (((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋) → (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
53, 4syl 18 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
6 ufilfil 24092 . . 3 (𝐿 ∈ (UFil‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
7 fcfval 24221 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)))
86, 7syl3an2 1182 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = (𝐽 fClus ((𝑋 FilMap 𝐹)‘𝐿)))
9 flfval 24178 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
106, 9syl3an2 1182 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
115, 8, 103eqtr4d 2810 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fClusf 𝐿)‘𝐹) = ((𝐽 fLimf 𝐿)‘𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  w3a 1103   = wceq 1570  wcel 2146  wf 6536  cfv 6540  (class class class)co 7416  TopOnctopon 23097  Filcfil 24033  UFilcufil 24087   FilMap cfm 24121   fLim cflim 24122   fLimf cflf 24123   fClus cfcls 24124   fClusf cfcf 24125
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-iin 4961  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1o 8455  df-2o 8456  df-map 8828  df-en 8946  df-fin 8949  df-fi 9374  df-fbas 21549  df-fg 21550  df-top 23081  df-topon 23098  df-cld 23206  df-ntr 23207  df-cls 23208  df-nei 23285  df-fil 24034  df-ufil 24089  df-fm 24126  df-flim 24127  df-flf 24128  df-fcls 24129  df-fcf 24130
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator