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

Theorem cncls2 23136
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 23112 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋𝑌)
213expia 1121 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌))
3 elpwi 4566 . . . . . . 7 (𝑥 ∈ 𝒫 𝑌𝑥𝑌)
43adantl 481 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥𝑌)
5 toponuni 22777 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 727 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = 𝐾)
74, 6sseqtrd 3980 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 𝐾)
8 eqid 2729 . . . . . . 7 𝐾 = 𝐾
98cncls2i 23133 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))
109expcom 413 . . . . 5 (𝑥 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
117, 10syl 17 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
1211ralrimdva 3133 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
132, 12jcad 512 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
148cldss2 22893 . . . . . . . . 9 (Clsd‘𝐾) ⊆ 𝒫 𝐾
155ad2antlr 727 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → 𝑌 = 𝐾)
1615pweqd 4576 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → 𝒫 𝑌 = 𝒫 𝐾)
1714, 16sseqtrrid 3987 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (Clsd‘𝐾) ⊆ 𝒫 𝑌)
1817sseld 3942 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝑥 ∈ (Clsd‘𝐾) → 𝑥 ∈ 𝒫 𝑌))
1918imim1d 82 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥 ∈ 𝒫 𝑌 → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → (𝑥 ∈ (Clsd‘𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
20 cldcls 22905 . . . . . . . . . . . 12 (𝑥 ∈ (Clsd‘𝐾) → ((cls‘𝐾)‘𝑥) = 𝑥)
2120ad2antll 729 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → ((cls‘𝐾)‘𝑥) = 𝑥)
2221imaeq2d 6020 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (𝐹 “ ((cls‘𝐾)‘𝑥)) = (𝐹𝑥))
2322sseq2d 3976 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) ↔ ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥)))
24 topontop 22776 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2524ad2antrr 726 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → 𝐽 ∈ Top)
26 cnvimass 6042 . . . . . . . . . . 11 (𝐹𝑥) ⊆ dom 𝐹
27 fdm 6679 . . . . . . . . . . . . 13 (𝐹:𝑋𝑌 → dom 𝐹 = 𝑋)
2827ad2antrl 728 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → dom 𝐹 = 𝑋)
29 toponuni 22777 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
3029ad2antrr 726 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → 𝑋 = 𝐽)
3128, 30eqtrd 2764 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → dom 𝐹 = 𝐽)
3226, 31sseqtrid 3986 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (𝐹𝑥) ⊆ 𝐽)
33 eqid 2729 . . . . . . . . . . 11 𝐽 = 𝐽
3433iscld4 22928 . . . . . . . . . 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 3142 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) → ∀𝑥 ∈ (Clsd‘𝐾)(𝐹𝑥) ∈ (Clsd‘𝐽)))
4140imdistanda 571 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ (Clsd‘𝐾)(𝐹𝑥) ∈ (Clsd‘𝐽))))
42 iscncl 23132 . . 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 1540  wcel 2109  wral 3044  wss 3911  𝒫 cpw 4559   cuni 4867  ccnv 5630  dom cdm 5631  cima 5634  wf 6495  cfv 6499  (class class class)co 7369  Topctop 22756  TopOnctopon 22773  Clsdccld 22879  clsccl 22881   Cn ccn 23087
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-iin 4954  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7372  df-oprab 7373  df-mpo 7374  df-map 8778  df-top 22757  df-topon 22774  df-cld 22882  df-cls 22884  df-cn 23090
This theorem is referenced by:  cncls  23137
  Copyright terms: Public domain W3C validator