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

Theorem cnntr 14948
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 14928 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋𝑌)
213expia 1231 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌))
3 elpwi 3661 . . . . . . 7 (𝑥 ∈ 𝒫 𝑌𝑥𝑌)
43adantl 277 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥𝑌)
5 toponuni 14738 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 489 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = 𝐾)
74, 6sseqtrd 3265 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 𝐾)
8 eqid 2231 . . . . . . 7 𝐾 = 𝐾
98cnntri 14947 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))
109expcom 116 . . . . 5 (𝑥 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
117, 10syl 14 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
1211ralrimdva 2612 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
132, 12jcad 307 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))))
14 toponss 14749 . . . . . . . . . 10 ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥𝐾) → 𝑥𝑌)
15 velpw 3659 . . . . . . . . . 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 14737 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2120ad3antrrr 492 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝐽 ∈ Top)
22 cnvimass 5099 . . . . . . . . . . 11 (𝐹𝑥) ⊆ dom 𝐹
23 fdm 5488 . . . . . . . . . . . . 13 (𝐹:𝑋𝑌 → dom 𝐹 = 𝑋)
2423ad2antlr 489 . . . . . . . . . . . 12 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → dom 𝐹 = 𝑋)
25 toponuni 14738 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
2625ad3antrrr 492 . . . . . . . . . . . 12 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝑋 = 𝐽)
2724, 26eqtrd 2264 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → dom 𝐹 = 𝐽)
2822, 27sseqtrid 3277 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (𝐹𝑥) ⊆ 𝐽)
29 eqid 2231 . . . . . . . . . . 11 𝐽 = 𝐽
3029ntrss2 14844 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐹𝑥) ⊆ 𝐽) → ((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥))
3121, 28, 30syl2anc 411 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥))
32 eqss 3242 . . . . . . . . . 10 (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥) ∧ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3332baib 926 . . . . . . . . 9 (((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥) → (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3431, 33syl 14 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3529isopn3 14848 . . . . . . . . 9 ((𝐽 ∈ Top ∧ (𝐹𝑥) ⊆ 𝐽) → ((𝐹𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥)))
3621, 28, 35syl2anc 411 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((𝐹𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥)))
37 topontop 14737 . . . . . . . . . . . 12 (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
3837ad3antlr 493 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝐾 ∈ Top)
39 isopn3i 14858 . . . . . . . . . . 11 ((𝐾 ∈ Top ∧ 𝑥𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
4038, 39sylancom 420 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
4140imaeq2d 5076 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) = (𝐹𝑥))
4241sseq1d 3256 . . . . . . . 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 2602 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)) → ∀𝑥𝐾 (𝐹𝑥) ∈ 𝐽))
4746imdistanda 448 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))) → (𝐹:𝑋𝑌 ∧ ∀𝑥𝐾 (𝐹𝑥) ∈ 𝐽)))
48 iscn 14920 . . 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 1397  wcel 2202  wral 2510  wss 3200  𝒫 cpw 3652   cuni 3893  ccnv 4724  dom cdm 4725  cima 4728  wf 5322  cfv 5326  (class class class)co 6017  Topctop 14720  TopOnctopon 14733  intcnt 14816   Cn ccn 14908
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-map 6818  df-top 14721  df-topon 14734  df-ntr 14819  df-cn 14911
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator