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

Theorem cnpflf 24347
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 23595 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:𝑋⟶𝑌)
213expa 1136 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:𝑋⟶𝑌)
323adantl3 1187 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → 𝐹:𝑋⟶𝑌)
4 cnpflfi 24345 . . . . . . 7 ((𝐴 ∈ (𝐽 fLim 𝑓) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴)) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹))
54expcom 419 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) → (𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)))
65ralrimivw 3162 . . . . 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 24320 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})))
1310, 11, 12syl2anc 596 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})))
1411snssd 4747 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → {𝐴} ⊆ 𝑋)
1511snn0d 4736 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → {𝐴} ≠ ∅)
16 neifil 24226 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ {𝐴} ⊆ 𝑋 ∧ {𝐴} ≠ ∅) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
1710, 14, 15, 16syl3anc 1399 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ 𝐹:𝑋⟶𝑌) → ((nei‘𝐽)‘{𝐴}) ∈ (Fil‘𝑋))
18 oveq2 7448 . . . . . . . . 9 (𝑓 = ((nei‘𝐽)‘{𝐴}) → (𝐽 fLim 𝑓) = (𝐽 fLim ((nei‘𝐽)‘{𝐴})))
1918eleq2d 2850 . . . . . . . 8 (𝑓 = ((nei‘𝐽)‘{𝐴}) → (𝐴 ∈ (𝐽 fLim 𝑓) ↔ 𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴}))))
20 oveq2 7448 . . . . . . . . . 10 (𝑓 = ((nei‘𝐽)‘{𝐴}) → (𝐾 fLimf 𝑓) = (𝐾 fLimf ((nei‘𝐽)‘{𝐴})))
2120fveq1d 6907 . . . . . . . . 9 (𝑓 = ((nei‘𝐽)‘{𝐴}) → ((𝐾 fLimf 𝑓)‘𝐹) = ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))
2221eleq2d 2850 . . . . . . . 8 (𝑓 = ((nei‘𝐽)‘{𝐴}) → ((𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹) ↔ (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹)))
2319, 22imbi12d 347 . . . . . . 7 (𝑓 = ((nei‘𝐽)‘{𝐴}) → ((𝐴 ∈ (𝐽 fLim 𝑓) → (𝐹‘𝐴) ∈ ((𝐾 fLimf 𝑓)‘𝐹)) ↔ (𝐴 ∈ (𝐽 fLim ((nei‘𝐽)‘{𝐴})) → (𝐹‘𝐴) ∈ ((𝐾 fLimf ((nei‘𝐽)‘{𝐴}))‘𝐹))))
2423rspcv 3576 . . . . . 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 2763 . . . 4 ((nei‘𝐽)‘{𝐴}) = ((nei‘𝐽)‘{𝐴})
2928cnpflf2 24346 . . 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 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080   ⊆ wss 3900  ∅c0 4281  {csn 4588  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440  TopOnctopon 23255  neicnei 23442   CnP ccnp 23570  Filcfil 24191   fLim cflim 24280   fLimf cflf 24281
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-map 8874  df-fbas 21702  df-fg 21703  df-top 23239  df-topon 23256  df-ntr 23365  df-nei 23443  df-cnp 23573  df-fil 24192  df-fm 24284  df-flim 24285  df-flf 24286
This theorem is used by:  cnflf  24348  cnpfcf  24387
  Copyright terms: Public domain W3C validator