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

Theorem flfval 24222
Description: Given a function from a filtered set to a topological space, define the set of limit points of the function. (Contributed by Jeff Hankins, 8-Nov-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)
Assertion
Ref Expression
flfval ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))

Proof of Theorem flfval
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 toponmax 23157 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
2 filtop 24087 . . . . 5 (𝐿 ∈ (Fil‘𝑌) → 𝑌𝐿)
3 elmapg 8842 . . . . 5 ((𝑋𝐽𝑌𝐿) → (𝐹 ∈ (𝑋m 𝑌) ↔ 𝐹:𝑌𝑋))
41, 2, 3syl2an 608 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (𝐹 ∈ (𝑋m 𝑌) ↔ 𝐹:𝑌𝑋))
54biimpar 483 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) ∧ 𝐹:𝑌𝑋) → 𝐹 ∈ (𝑋m 𝑌))
6 flffval 24221 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (𝐽 fLimf 𝐿) = (𝑓 ∈ (𝑋m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿))))
76fveq1d 6884 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → ((𝐽 fLimf 𝐿)‘𝐹) = ((𝑓 ∈ (𝑋m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿)))‘𝐹))
8 oveq2 7425 . . . . . . 7 (𝑓 = 𝐹 → (𝑋 FilMap 𝑓) = (𝑋 FilMap 𝐹))
98fveq1d 6884 . . . . . 6 (𝑓 = 𝐹 → ((𝑋 FilMap 𝑓)‘𝐿) = ((𝑋 FilMap 𝐹)‘𝐿))
109oveq2d 7433 . . . . 5 (𝑓 = 𝐹 → (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿)) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
11 eqid 2762 . . . . 5 (𝑓 ∈ (𝑋m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿))) = (𝑓 ∈ (𝑋m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿)))
12 ovex 7450 . . . . 5 (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)) ∈ V
1310, 11, 12fvmpt 6990 . . . 4 (𝐹 ∈ (𝑋m 𝑌) → ((𝑓 ∈ (𝑋m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿)))‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
147, 13sylan9eq 2817 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) ∧ 𝐹 ∈ (𝑋m 𝑌)) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
155, 14syldan 603 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
16153impa 1127 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  cmpt 5190  wf 6533  cfv 6537  (class class class)co 7417  m cmap 8830  TopOnctopon 23141  Filcfil 24077   FilMap cfm 24165   fLim cflim 24166   fLimf cflf 24167
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-map 8832  df-fbas 21588  df-top 23125  df-topon 23142  df-fil 24078  df-flf 24172
This theorem is used by:  flfnei  24223  isflf  24225  hausflf  24229  flfcnp  24236  flfssfcf  24270  uffcfflf  24271  cnpfcf  24273  cnextcn  24299  tsmscls  24370  cnextucn  24534  cmetcaulem  25522  fmcncfil  34449
  Copyright terms: Public domain W3C validator