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

Theorem cnfcf 24388
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 23625 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))))
2 simplr 781 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐹:𝑋⟶𝑌)
3 cnpfcf 24387 . . . . . . 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 3187 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ 𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ∀𝑥 ∈ 𝑋 ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
7 ralcom 3294 . . . . 5 (∀𝑥 ∈ 𝑋 ∀𝑓 ∈ (Fil‘𝑋)(𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)) ↔ ∀𝑓 ∈ (Fil‘𝑋)∀𝑥 ∈ 𝑋 (𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹)))
8 eqid 2763 . . . . . . . . . . . 12 ∪ 𝐽 = ∪ 𝐽
98fclselbas 24362 . . . . . . . . . . 11 (𝑥 ∈ (𝐽 fClus 𝑓) → 𝑥 ∈ ∪ 𝐽)
10 toponuni 23259 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
1110ad2antrr 739 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → 𝑋 = ∪ 𝐽)
1211eleq2d 2850 . . . . . . . . . . 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 3185 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ (𝐽 fClus 𝑓)(𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹) ↔ ∀𝑥 ∈ 𝑋 (𝑥 ∈ (𝐽 fClus 𝑓) → (𝐹‘𝑥) ∈ ((𝐾 fClusf 𝑓)‘𝐹))))
1918ralbidv 3189 . . . . 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 1570   ∈ wcel 2147  ∀wral 3080  ∪ cuni 4870  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440  TopOnctopon 23255   Cn ccn 23569   CnP ccnp 23570  Filcfil 24191   fClus cfcls 24282   fClusf cfcf 24283
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-3or 1104  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-pss 4017  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-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  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-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  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-om 7899  df-1st 8022  df-2nd 8023  df-1o 8501  df-2o 8502  df-map 8874  df-en 8999  df-fin 9002  df-fi 9427  df-topgen 17640  df-fbas 21702  df-fg 21703  df-top 23239  df-topon 23256  df-cld 23364  df-ntr 23365  df-cls 23366  df-nei 23443  df-cn 23572  df-cnp 23573  df-fil 24192  df-fm 24284  df-flim 24285  df-flf 24286  df-fcls 24287  df-fcf 24288
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator