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

Theorem hausflf 24123
Description: If a function has its values in a Hausdorff space, then it has at most one limit value. (Contributed by FL, 14-Nov-2010.) (Revised by Stefan O'Rear, 6-Aug-2015.)
Hypothesis
Ref Expression
hausflf.x 𝑋 = 𝐽
Assertion
Ref Expression
hausflf ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ∃*𝑥 𝑥 ∈ ((𝐽 fLimf 𝐿)‘𝐹))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐽   𝑥,𝐿   𝑥,𝑋   𝑥,𝑌

Proof of Theorem hausflf
StepHypRef Expression
1 hausflimi 24106 . . 3 (𝐽 ∈ Haus → ∃*𝑥 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
213ad2ant1 1149 . 2 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ∃*𝑥 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
3 haustop 23457 . . . . . 6 (𝐽 ∈ Haus → 𝐽 ∈ Top)
4 hausflf.x . . . . . . 7 𝑋 = 𝐽
54toptopon 23043 . . . . . 6 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
63, 5sylib 221 . . . . 5 (𝐽 ∈ Haus → 𝐽 ∈ (TopOn‘𝑋))
7 flfval 24116 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
86, 7syl3an1 1179 . . . 4 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
98eleq2d 2855 . . 3 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → (𝑥 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿))))
109mobidv 2583 . 2 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → (∃*𝑥 𝑥 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ ∃*𝑥 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿))))
112, 10mpbird 260 1 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ∃*𝑥 𝑥 ∈ ((𝐽 fLimf 𝐿)‘𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1101   = wceq 1567  wcel 2149  ∃*wmo 2571   cuni 4874  wf 6533  cfv 6537  (class class class)co 7411  Topctop 23019  TopOnctopon 23036  Hauscha 23434  Filcfil 23971   FilMap cfm 24059   fLim cflim 24060   fLimf cflf 24061
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3376  df-rab 3423  df-v 3463  df-sbc 3752  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  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 7414  df-oprab 7415  df-mpo 7416  df-map 8826  df-fbas 21488  df-top 23020  df-topon 23037  df-nei 23224  df-haus 23441  df-fil 23972  df-flim 24065  df-flf 24066
This theorem is referenced by:  hausflf2  24124  cnextfun  24190  haustsms  24262  limcmo  26010
  Copyright terms: Public domain W3C validator