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

Theorem cncls2 23215
Description: Continuity in terms of closure. (Contributed by Mario Carneiro, 25-Aug-2015.)
Assertion
Ref Expression
cncls2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐽   𝑥,𝐾   𝑥,𝑋   𝑥,𝑌

Proof of Theorem cncls2
StepHypRef Expression
1 cnf2 23191 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋𝑌)
213expia 1121 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌))
3 elpwi 4559 . . . . . . 7 (𝑥 ∈ 𝒫 𝑌𝑥𝑌)
43adantl 481 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥𝑌)
5 toponuni 22856 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 727 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = 𝐾)
74, 6sseqtrd 3968 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 𝐾)
8 eqid 2734 . . . . . . 7 𝐾 = 𝐾
98cncls2i 23212 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))
109expcom 413 . . . . 5 (𝑥 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
117, 10syl 17 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
1211ralrimdva 3134 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
132, 12jcad 512 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
148cldss2 22972 . . . . . . . . 9 (Clsd‘𝐾) ⊆ 𝒫 𝐾
155ad2antlr 727 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → 𝑌 = 𝐾)
1615pweqd 4569 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → 𝒫 𝑌 = 𝒫 𝐾)
1714, 16sseqtrrid 3975 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (Clsd‘𝐾) ⊆ 𝒫 𝑌)
1817sseld 3930 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝑥 ∈ (Clsd‘𝐾) → 𝑥 ∈ 𝒫 𝑌))
1918imim1d 82 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥 ∈ 𝒫 𝑌 → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → (𝑥 ∈ (Clsd‘𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
20 cldcls 22984 . . . . . . . . . . . 12 (𝑥 ∈ (Clsd‘𝐾) → ((cls‘𝐾)‘𝑥) = 𝑥)
2120ad2antll 729 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → ((cls‘𝐾)‘𝑥) = 𝑥)
2221imaeq2d 6017 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (𝐹 “ ((cls‘𝐾)‘𝑥)) = (𝐹𝑥))
2322sseq2d 3964 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) ↔ ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥)))
24 topontop 22855 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2524ad2antrr 726 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → 𝐽 ∈ Top)
26 cnvimass 6039 . . . . . . . . . . 11 (𝐹𝑥) ⊆ dom 𝐹
27 fdm 6669 . . . . . . . . . . . . 13 (𝐹:𝑋𝑌 → dom 𝐹 = 𝑋)
2827ad2antrl 728 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → dom 𝐹 = 𝑋)
29 toponuni 22856 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
3029ad2antrr 726 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → 𝑋 = 𝐽)
3128, 30eqtrd 2769 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → dom 𝐹 = 𝐽)
3226, 31sseqtrid 3974 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (𝐹𝑥) ⊆ 𝐽)
33 eqid 2734 . . . . . . . . . . 11 𝐽 = 𝐽
3433iscld4 23007 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐹𝑥) ⊆ 𝐽) → ((𝐹𝑥) ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥)))
3525, 32, 34syl2anc 584 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → ((𝐹𝑥) ∈ (Clsd‘𝐽) ↔ ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥)))
3623, 35bitr4d 282 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) ↔ (𝐹𝑥) ∈ (Clsd‘𝐽)))
3736expr 456 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝑥 ∈ (Clsd‘𝐾) → (((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) ↔ (𝐹𝑥) ∈ (Clsd‘𝐽))))
3837pm5.74d 273 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥 ∈ (Clsd‘𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) ↔ (𝑥 ∈ (Clsd‘𝐾) → (𝐹𝑥) ∈ (Clsd‘𝐽))))
3919, 38sylibd 239 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥 ∈ 𝒫 𝑌 → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → (𝑥 ∈ (Clsd‘𝐾) → (𝐹𝑥) ∈ (Clsd‘𝐽))))
4039ralimdv2 3143 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) → ∀𝑥 ∈ (Clsd‘𝐾)(𝐹𝑥) ∈ (Clsd‘𝐽)))
4140imdistanda 571 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ (Clsd‘𝐾)(𝐹𝑥) ∈ (Clsd‘𝐽))))
42 iscncl 23211 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ (Clsd‘𝐾)(𝐹𝑥) ∈ (Clsd‘𝐽))))
4341, 42sylibrd 259 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → 𝐹 ∈ (𝐽 Cn 𝐾)))
4413, 43impbid 212 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3049  wss 3899  𝒫 cpw 4552   cuni 4861  ccnv 5621  dom cdm 5622  cima 5625  wf 6486  cfv 6490  (class class class)co 7356  Topctop 22835  TopOnctopon 22852  Clsdccld 22958  clsccl 22960   Cn ccn 23166
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8763  df-top 22836  df-topon 22853  df-cld 22961  df-cls 22963  df-cn 23169
This theorem is referenced by:  cncls  23216
  Copyright terms: Public domain W3C validator