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

Theorem cnfcf 24361
Description: Continuity of a function in terms of cluster points of a function. (Contributed by Jeff Hankins, 28-Nov-2009.) (Revised by Stefan O'Rear, 9-Aug-2015.)
Assertion
Ref Expression
cnfcf ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
Distinct variable groups:   𝑥,𝑓,𝐹   𝑓,𝐽,𝑥   𝑓,𝐾,𝑥   𝑓,𝑋,𝑥   𝑓,𝑌,𝑥

Proof of Theorem cnfcf
StepHypRef Expression
1 cncnp 23598 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))))
2 simplr 781 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐹:𝑋⟶𝑌)
3 cnpfcf 24360 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)))))
43ad4ant124 1192 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)))))
52, 4mpbirand 720 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
65ralbidva 3183 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ∀𝑥 ∈ 𝑋 ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
7 ralcom 3290 . . . . 5 (∀𝑥 ∈ 𝑋 ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)) ↔ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ 𝑋 (𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)))
8 eqid 2760 . . . . . . . . . . . 12 ∪ 𝐽 = ∪ 𝐽
98fclselbas 24335 . . . . . . . . . . 11 (𝑥 ∈ (𝐽 fClus 𝑓) → 𝑥 ∈ ∪ 𝐽)
10 toponuni 23232 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
1110ad2antrr 739 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → 𝑋 = ∪ 𝐽)
1211eleq2d 2846 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (𝑥 ∈ 𝑋 ↔ 𝑥 ∈ ∪ 𝐽))
139, 12imbitrrid 249 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (𝑥 ∈ (𝐽 fClus 𝑓) → 𝑥 ∈ 𝑋))
1413pm4.71rd 572 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (𝑥 ∈ (𝐽 fClus 𝑓) ↔ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ (𝐽 fClus 𝑓))))
1514imbi1d 344 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)) ↔ ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ (𝐽 fClus 𝑓)) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
16 impexp 456 . . . . . . . 8 (((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ (𝐽 fClus 𝑓)) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)) ↔ (𝑥 ∈ 𝑋 → (𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
1715, 16bitrdi 290 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)) ↔ (𝑥 ∈ 𝑋 → (𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)))))
1817ralbidv2 3181 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹) ↔ ∀𝑥 ∈ 𝑋 (𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
1918ralbidv 3185 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹) ↔ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ 𝑋 (𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
207, 19bitr4id 293 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ 𝑋 ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)) ↔ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)))
216, 20bitrd 282 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)))
2221pm5.32da 590 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
231, 22bitrd 282 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∪ cuni 4866  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  TopOnctopon 23228   Cn ccn 23542   CnP ccnp 23543  Filcfil 24164   fClus cfcls 24255   fClusf cfcf 24256
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-3or 1104  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-pss 4014  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-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  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-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  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-om 7878  df-1st 8001  df-2nd 8002  df-1o 8476  df-2o 8477  df-map 8849  df-en 8974  df-fin 8977  df-fi 9403  df-topgen 17614  df-fbas 21675  df-fg 21676  df-top 23212  df-topon 23229  df-cld 23337  df-ntr 23338  df-cls 23339  df-nei 23416  df-cn 23545  df-cnp 23546  df-fil 24165  df-fm 24257  df-flim 24258  df-flf 24259  df-fcls 24260  df-fcf 24261
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator