ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnntr GIF version

Theorem cnntr 14899
Description: Continuity in terms of interior. (Contributed by Jeff Hankins, 2-Oct-2009.) (Proof shortened by Mario Carneiro, 25-Aug-2015.)
Assertion
Ref Expression
cnntr ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐽   𝑥,𝐾   𝑥,𝑋   𝑥,𝑌

Proof of Theorem cnntr
StepHypRef Expression
1 cnf2 14879 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋𝑌)
213expia 1229 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌))
3 elpwi 3658 . . . . . . 7 (𝑥 ∈ 𝒫 𝑌𝑥𝑌)
43adantl 277 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥𝑌)
5 toponuni 14689 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 489 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = 𝐾)
74, 6sseqtrd 3262 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 𝐾)
8 eqid 2229 . . . . . . 7 𝐾 = 𝐾
98cnntri 14898 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))
109expcom 116 . . . . 5 (𝑥 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
117, 10syl 14 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
1211ralrimdva 2610 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
132, 12jcad 307 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))))
14 toponss 14700 . . . . . . . . . 10 ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥𝐾) → 𝑥𝑌)
15 velpw 3656 . . . . . . . . . 10 (𝑥 ∈ 𝒫 𝑌𝑥𝑌)
1614, 15sylibr 134 . . . . . . . . 9 ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥𝐾) → 𝑥 ∈ 𝒫 𝑌)
1716ex 115 . . . . . . . 8 (𝐾 ∈ (TopOn‘𝑌) → (𝑥𝐾𝑥 ∈ 𝒫 𝑌))
1817ad2antlr 489 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝑥𝐾𝑥 ∈ 𝒫 𝑌))
1918imim1d 75 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥 ∈ 𝒫 𝑌 → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))) → (𝑥𝐾 → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))))
20 topontop 14688 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2120ad3antrrr 492 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝐽 ∈ Top)
22 cnvimass 5091 . . . . . . . . . . 11 (𝐹𝑥) ⊆ dom 𝐹
23 fdm 5479 . . . . . . . . . . . . 13 (𝐹:𝑋𝑌 → dom 𝐹 = 𝑋)
2423ad2antlr 489 . . . . . . . . . . . 12 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → dom 𝐹 = 𝑋)
25 toponuni 14689 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
2625ad3antrrr 492 . . . . . . . . . . . 12 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝑋 = 𝐽)
2724, 26eqtrd 2262 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → dom 𝐹 = 𝐽)
2822, 27sseqtrid 3274 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (𝐹𝑥) ⊆ 𝐽)
29 eqid 2229 . . . . . . . . . . 11 𝐽 = 𝐽
3029ntrss2 14795 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐹𝑥) ⊆ 𝐽) → ((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥))
3121, 28, 30syl2anc 411 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥))
32 eqss 3239 . . . . . . . . . 10 (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥) ∧ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3332baib 924 . . . . . . . . 9 (((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥) → (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3431, 33syl 14 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3529isopn3 14799 . . . . . . . . 9 ((𝐽 ∈ Top ∧ (𝐹𝑥) ⊆ 𝐽) → ((𝐹𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥)))
3621, 28, 35syl2anc 411 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((𝐹𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥)))
37 topontop 14688 . . . . . . . . . . . 12 (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
3837ad3antlr 493 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝐾 ∈ Top)
39 isopn3i 14809 . . . . . . . . . . 11 ((𝐾 ∈ Top ∧ 𝑥𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
4038, 39sylancom 420 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
4140imaeq2d 5068 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) = (𝐹𝑥))
4241sseq1d 3253 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)) ↔ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
4334, 36, 423bitr4rd 221 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)) ↔ (𝐹𝑥) ∈ 𝐽))
4443pm5.74da 443 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥𝐾 → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))) ↔ (𝑥𝐾 → (𝐹𝑥) ∈ 𝐽)))
4519, 44sylibd 149 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → ((𝑥 ∈ 𝒫 𝑌 → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))) → (𝑥𝐾 → (𝐹𝑥) ∈ 𝐽)))
4645ralimdv2 2600 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)) → ∀𝑥𝐾 (𝐹𝑥) ∈ 𝐽))
4746imdistanda 448 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))) → (𝐹:𝑋𝑌 ∧ ∀𝑥𝐾 (𝐹𝑥) ∈ 𝐽)))
48 iscn 14871 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥𝐾 (𝐹𝑥) ∈ 𝐽)))
4947, 48sylibrd 169 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))) → 𝐹 ∈ (𝐽 Cn 𝐾)))
5013, 49impbid 129 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wcel 2200  wral 2508  wss 3197  𝒫 cpw 3649   cuni 3888  ccnv 4718  dom cdm 4719  cima 4722  wf 5314  cfv 5318  (class class class)co 6001  Topctop 14671  TopOnctopon 14684  intcnt 14767   Cn ccn 14859
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-map 6797  df-top 14672  df-topon 14685  df-ntr 14770  df-cn 14862
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator