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

Theorem flffval 24341
Description: Given a topology and a filtered set, return the convergence function on the functions from the filtered set to the base set of the topological space. (Contributed by Jeff Hankins, 14-Oct-2009.) (Revised by Mario Carneiro, 15-Dec-2013.) (Revised by Stefan O'Rear, 6-Aug-2015.)
Assertion
Ref Expression
flffval ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (𝐽 fLimf 𝐿) = (𝑓 ∈ (𝑋 ↑m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿))))
Distinct variable groups:   𝑓,𝐽   𝑓,𝑋   𝑓,𝑌   𝑓,𝐿

Proof of Theorem flffval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 topontop 23264 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2 fvssunirn 6942 . . . 4 (Fil‘𝑌) ⊆ ∪ ran Fil
32sseli 3909 . . 3 (𝐿 ∈ (Fil‘𝑌) → 𝐿 ∈ ∪ ran Fil)
4 unieq 4881 . . . . . 6 (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽)
5 unieq 4881 . . . . . 6 (𝑦 = 𝐿 → ∪ 𝑦 = ∪ 𝐿)
64, 5oveqan12d 7465 . . . . 5 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → (∪ 𝑥 ↑m ∪ 𝑦) = (∪ 𝐽 ↑m ∪ 𝐿))
7 simpl 488 . . . . . 6 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → 𝑥 = 𝐽)
84adantr 486 . . . . . . . 8 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → ∪ 𝑥 = ∪ 𝐽)
98oveq1d 7461 . . . . . . 7 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → (∪ 𝑥 FilMap 𝑓) = (∪ 𝐽 FilMap 𝑓))
10 simpr 490 . . . . . . 7 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → 𝑦 = 𝐿)
119, 10fveq12d 6918 . . . . . 6 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → ((∪ 𝑥 FilMap 𝑓)‘𝑦) = ((∪ 𝐽 FilMap 𝑓)‘𝐿))
127, 11oveq12d 7464 . . . . 5 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → (𝑥 fLim ((∪ 𝑥 FilMap 𝑓)‘𝑦)) = (𝐽 fLim ((∪ 𝐽 FilMap 𝑓)‘𝐿)))
136, 12mpteq12dv 5196 . . . 4 ((𝑥 = 𝐽 ∧ 𝑦 = 𝐿) → (𝑓 ∈ (∪ 𝑥 ↑m ∪ 𝑦) ↦ (𝑥 fLim ((∪ 𝑥 FilMap 𝑓)‘𝑦))) = (𝑓 ∈ (∪ 𝐽 ↑m ∪ 𝐿) ↦ (𝐽 fLim ((∪ 𝐽 FilMap 𝑓)‘𝐿))))
14 df-flf 24292 . . . 4 fLimf = (𝑥 ∈ Top, 𝑦 ∈ ∪ ran Fil ↦ (𝑓 ∈ (∪ 𝑥 ↑m ∪ 𝑦) ↦ (𝑥 fLim ((∪ 𝑥 FilMap 𝑓)‘𝑦))))
15 ovex 7479 . . . . 5 (∪ 𝐽 ↑m ∪ 𝐿) ∈ V
1615mptex 7255 . . . 4 (𝑓 ∈ (∪ 𝐽 ↑m ∪ 𝐿) ↦ (𝐽 fLim ((∪ 𝐽 FilMap 𝑓)‘𝐿))) ∈ V
1713, 14, 16ovmpoa 7602 . . 3 ((𝐽 ∈ Top ∧ 𝐿 ∈ ∪ ran Fil) → (𝐽 fLimf 𝐿) = (𝑓 ∈ (∪ 𝐽 ↑m ∪ 𝐿) ↦ (𝐽 fLim ((∪ 𝐽 FilMap 𝑓)‘𝐿))))
181, 3, 17syl2an 608 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (𝐽 fLimf 𝐿) = (𝑓 ∈ (∪ 𝐽 ↑m ∪ 𝐿) ↦ (𝐽 fLim ((∪ 𝐽 FilMap 𝑓)‘𝐿))))
19 toponuni 23265 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
2019eqcomd 2769 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → ∪ 𝐽 = 𝑋)
21 filunibas 24233 . . . 4 (𝐿 ∈ (Fil‘𝑌) → ∪ 𝐿 = 𝑌)
2220, 21oveqan12d 7465 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (∪ 𝐽 ↑m ∪ 𝐿) = (𝑋 ↑m 𝑌))
2320adantr 486 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → ∪ 𝐽 = 𝑋)
2423oveq1d 7461 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (∪ 𝐽 FilMap 𝑓) = (𝑋 FilMap 𝑓))
2524fveq1d 6913 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → ((∪ 𝐽 FilMap 𝑓)‘𝐿) = ((𝑋 FilMap 𝑓)‘𝐿))
2625oveq2d 7462 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (𝐽 fLim ((∪ 𝐽 FilMap 𝑓)‘𝐿)) = (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿)))
2722, 26mpteq12dv 5196 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (𝑓 ∈ (∪ 𝐽 ↑m ∪ 𝐿) ↦ (𝐽 fLim ((∪ 𝐽 FilMap 𝑓)‘𝐿))) = (𝑓 ∈ (𝑋 ↑m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿))))
2818, 27eqtrd 2798 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌)) → (𝐽 fLimf 𝐿) = (𝑓 ∈ (𝑋 ↑m 𝑌) ↦ (𝐽 fLim ((𝑋 FilMap 𝑓)‘𝐿))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∪ cuni 4870   ↦ cmpt 5190  ran crn 5657  ‘cfv 6561  (class class class)co 7446   ↑m cmap 8878  Topctop 23244  TopOnctopon 23261  Filcfil 24197   FilMap cfm 24285   fLim cflim 24286   fLimf cflf 24287
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-fbas 21708  df-topon 23262  df-fil 24198  df-flf 24292
This theorem is used by:  flfval  24342
  Copyright terms: Public domain W3C validator