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

Theorem cncls2 23217
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 23193 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋𝑌)
213expia 1121 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌))
3 elpwi 4561 . . . . . . 7 (𝑥 ∈ 𝒫 𝑌𝑥𝑌)
43adantl 481 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥𝑌)
5 toponuni 22858 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 727 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = 𝐾)
74, 6sseqtrd 3970 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 𝐾)
8 eqid 2736 . . . . . . 7 𝐾 = 𝐾
98cncls2i 23214 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))
109expcom 413 . . . . 5 (𝑥 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
117, 10syl 17 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
1211ralrimdva 3136 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))))
132, 12jcad 512 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
148cldss2 22974 . . . . . . . . 9 (Clsd‘𝐾) ⊆ 𝒫 𝐾
155ad2antlr 727 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → 𝑌 = 𝐾)
1615pweqd 4571 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → 𝒫 𝑌 = 𝒫 𝐾)
1714, 16sseqtrrid 3977 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (Clsd‘𝐾) ⊆ 𝒫 𝑌)
1817sseld 3932 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝑥 ∈ (Clsd‘𝐾) → 𝑥 ∈ 𝒫 𝑌))
1918imim1d 82 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥 ∈ 𝒫 𝑌 → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → (𝑥 ∈ (Clsd‘𝐾) → ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)))))
20 cldcls 22986 . . . . . . . . . . . 12 (𝑥 ∈ (Clsd‘𝐾) → ((cls‘𝐾)‘𝑥) = 𝑥)
2120ad2antll 729 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → ((cls‘𝐾)‘𝑥) = 𝑥)
2221imaeq2d 6019 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (𝐹 “ ((cls‘𝐾)‘𝑥)) = (𝐹𝑥))
2322sseq2d 3966 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) ↔ ((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥)))
24 topontop 22857 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2524ad2antrr 726 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → 𝐽 ∈ Top)
26 cnvimass 6041 . . . . . . . . . . 11 (𝐹𝑥) ⊆ dom 𝐹
27 fdm 6671 . . . . . . . . . . . . 13 (𝐹:𝑋𝑌 → dom 𝐹 = 𝑋)
2827ad2antrl 728 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → dom 𝐹 = 𝑋)
29 toponuni 22858 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
3029ad2antrr 726 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → 𝑋 = 𝐽)
3128, 30eqtrd 2771 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → dom 𝐹 = 𝐽)
3226, 31sseqtrid 3976 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝐹:𝑋𝑌𝑥 ∈ (Clsd‘𝐾))) → (𝐹𝑥) ⊆ 𝐽)
33 eqid 2736 . . . . . . . . . . 11 𝐽 = 𝐽
3433iscld4 23009 . . . . . . . . . 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 3145 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥)) → ∀𝑥 ∈ (Clsd‘𝐾)(𝐹𝑥) ∈ (Clsd‘𝐽)))
4140imdistanda 571 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌((cls‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹 “ ((cls‘𝐾)‘𝑥))) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ (Clsd‘𝐾)(𝐹𝑥) ∈ (Clsd‘𝐽))))
42 iscncl 23213 . . 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 3051  wss 3901  𝒫 cpw 4554   cuni 4863  ccnv 5623  dom cdm 5624  cima 5627  wf 6488  cfv 6492  (class class class)co 7358  Topctop 22837  TopOnctopon 22854  Clsdccld 22960  clsccl 22962   Cn ccn 23168
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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-iin 4949  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-map 8765  df-top 22838  df-topon 22855  df-cld 22963  df-cls 22965  df-cn 23171
This theorem is referenced by:  cncls  23218
  Copyright terms: Public domain W3C validator