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

Theorem cnpflf 24320
Description: Continuity of a function at a point in terms of filter limits. (Contributed by Jeff Hankins, 7-Sep-2009.) (Revised by Stefan O'Rear, 7-Aug-2015.)
Assertion
Ref Expression
cnpflf ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)))))
Distinct variable groups:   𝐴,𝑓   𝑓,𝑋   𝑓,𝑌   𝑓,𝐹   𝑓,𝐽   𝑓,𝐾

Proof of Theorem cnpflf
StepHypRef Expression
1 cnpf2 23568 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:𝑋⟶𝑌)
213expa 1136 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:𝑋⟶𝑌)
323adantl3 1187 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:𝑋⟶𝑌)
4 cnpflfi 24318 . . . . . . 7 ((𝐴 ∈ (𝐽 fLim 𝑓) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))
54expcom 419 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) → (𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)))
65ralrimivw 3158 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) → ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)))
76adantl 487 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)))
83, 7jca 521 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))))
98ex 418 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)))))
10 simpl1 1210 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → 𝐽 ∈ (TopOn‘𝑋))
11 simpl3 1212 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → 𝐴 ∈ 𝑋)
12 neiflim 24293 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})))
1310, 11, 12syl2anc 596 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})))
1411snssd 4746 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → {𝐴} ⊆ 𝑋)
1511snn0d 4735 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → {𝐴} ≠ ∅)
16 neifil 24199 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ {𝐴} ⊆ 𝑋 ∧ {𝐴} ≠ ∅) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
1710, 14, 15, 16syl3anc 1398 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
18 oveq2 7428 . . . . . . . . 9 (𝑓 = ((nei‘𝐽)‘{𝐴}) → (𝐽 fLim 𝑓) = (𝐽 fLim ((nei‘𝐽)‘{𝐴})))
1918eleq2d 2846 . . . . . . . 8 (𝑓 = ((nei‘𝐽)‘{𝐴}) → (𝐴 ∈ (𝐽 fLim 𝑓) ↔ 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴}))))
20 oveq2 7428 . . . . . . . . . 10 (𝑓 = ((nei‘𝐽)‘{𝐴}) → (𝐾 fLimf 𝑓) = (𝐾 fLimf ((nei‘𝐽)‘{𝐴})))
2120fveq1d 6887 . . . . . . . . 9 (𝑓 = ((nei‘𝐽)‘{𝐴}) → ((𝐾 fLimf 𝑓)‘𝐹) = ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))
2221eleq2d 2846 . . . . . . . 8 (𝑓 = ((nei‘𝐽)‘{𝐴}) → ((𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹) ↔ (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹)))
2319, 22imbi12d 347 . . . . . . 7 (𝑓 = ((nei‘𝐽)‘{𝐴}) → ((𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)) ↔ (𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})) → (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))))
2423rspcv 3572 . . . . . 6 (((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋) → (∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)) → (𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})) → (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))))
2517, 24syl 18 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)) → (𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})) → (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))))
2613, 25mpid 45 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)) → (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹)))
2726imdistanda 582 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))) → (𝐹:𝑋⟶𝑌 ∧ (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))))
28 eqid 2760 . . . 4 ((nei‘𝐽)‘{𝐴}) = ((nei‘𝐽)‘{𝐴})
2928cnpflf2 24319 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶𝑌 ∧ (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))))
3027, 29sylibrd 262 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)))
319, 30impbid 215 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076   ⊆ wss 3895  ∅c0 4278  {csn 4583  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  TopOnctopon 23228  neicnei 23415   CnP ccnp 23543  Filcfil 24164   fLim cflim 24253   fLimf cflf 24254
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849  df-fbas 21675  df-fg 21676  df-top 23212  df-topon 23229  df-ntr 23338  df-nei 23416  df-cnp 23546  df-fil 24165  df-fm 24257  df-flim 24258  df-flf 24259
This theorem is used by:  cnflf  24321  cnpfcf  24360
  Copyright terms: Public domain W3C validator