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

Theorem hausflf 24059
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 24042 . . 3 (𝐽 ∈ Haus → ∃*𝑥 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
213ad2ant1 1147 . 2 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ∃*𝑥 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
3 haustop 23393 . . . . . 6 (𝐽 ∈ Haus → 𝐽 ∈ Top)
4 hausflf.x . . . . . . 7 𝑋 = 𝐽
54toptopon 22979 . . . . . 6 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
63, 5sylib 220 . . . . 5 (𝐽 ∈ Haus → 𝐽 ∈ (TopOn‘𝑋))
7 flfval 24052 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
86, 7syl3an1 1177 . . . 4 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ((𝐽 fLimf 𝐿)‘𝐹) = (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿)))
98eleq2d 2850 . . 3 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → (𝑥 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿))))
109mobidv 2578 . 2 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → (∃*𝑥 𝑥 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ ∃*𝑥 𝑥 ∈ (𝐽 fLim ((𝑋 FilMap 𝐹)‘𝐿))))
112, 10mpbird 259 1 ((𝐽 ∈ Haus ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌𝑋) → ∃*𝑥 𝑥 ∈ ((𝐽 fLimf 𝐿)‘𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1099   = wceq 1562  wcel 2144  ∃*wmo 2566   cuni 4867  wf 6519  cfv 6523  (class class class)co 7398  Topctop 22955  TopOnctopon 22972  Hauscha 23370  Filcfil 23907   FilMap cfm 23995   fLim cflim 23996   fLimf cflf 23997
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-ov 7401  df-oprab 7402  df-mpo 7403  df-map 8812  df-fbas 21423  df-top 22956  df-topon 22973  df-nei 23160  df-haus 23377  df-fil 23908  df-flim 24001  df-flf 24002
This theorem is referenced by:  hausflf2  24060  cnextfun  24126  haustsms  24198  limcmo  25946
  Copyright terms: Public domain W3C validator