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

Theorem cnntr 14812
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 14792 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋𝑌)
213expia 1208 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌))
3 elpwi 3635 . . . . . . 7 (𝑥 ∈ 𝒫 𝑌𝑥𝑌)
43adantl 277 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥𝑌)
5 toponuni 14602 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = 𝐾)
65ad2antlr 489 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = 𝐾)
74, 6sseqtrd 3239 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 𝐾)
8 eqid 2207 . . . . . . 7 𝐾 = 𝐾
98cnntri 14811 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))
109expcom 116 . . . . 5 (𝑥 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
117, 10syl 14 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
1211ralrimdva 2588 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
132, 12jcad 307 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)))))
14 toponss 14613 . . . . . . . . . 10 ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥𝐾) → 𝑥𝑌)
15 velpw 3633 . . . . . . . . . 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 14601 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2120ad3antrrr 492 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝐽 ∈ Top)
22 cnvimass 5064 . . . . . . . . . . 11 (𝐹𝑥) ⊆ dom 𝐹
23 fdm 5451 . . . . . . . . . . . . 13 (𝐹:𝑋𝑌 → dom 𝐹 = 𝑋)
2423ad2antlr 489 . . . . . . . . . . . 12 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → dom 𝐹 = 𝑋)
25 toponuni 14602 . . . . . . . . . . . . 13 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
2625ad3antrrr 492 . . . . . . . . . . . 12 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝑋 = 𝐽)
2724, 26eqtrd 2240 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → dom 𝐹 = 𝐽)
2822, 27sseqtrid 3251 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (𝐹𝑥) ⊆ 𝐽)
29 eqid 2207 . . . . . . . . . . 11 𝐽 = 𝐽
3029ntrss2 14708 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐹𝑥) ⊆ 𝐽) → ((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥))
3121, 28, 30syl2anc 411 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥))
32 eqss 3216 . . . . . . . . . 10 (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥) ∧ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3332baib 921 . . . . . . . . 9 (((int‘𝐽)‘(𝐹𝑥)) ⊆ (𝐹𝑥) → (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3431, 33syl 14 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹𝑥) ⊆ ((int‘𝐽)‘(𝐹𝑥))))
3529isopn3 14712 . . . . . . . . 9 ((𝐽 ∈ Top ∧ (𝐹𝑥) ⊆ 𝐽) → ((𝐹𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥)))
3621, 28, 35syl2anc 411 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((𝐹𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(𝐹𝑥)) = (𝐹𝑥)))
37 topontop 14601 . . . . . . . . . . . 12 (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
3837ad3antlr 493 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → 𝐾 ∈ Top)
39 isopn3i 14722 . . . . . . . . . . 11 ((𝐾 ∈ Top ∧ 𝑥𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
4038, 39sylancom 420 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
4140imaeq2d 5041 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) ∧ 𝑥𝐾) → (𝐹 “ ((int‘𝐾)‘𝑥)) = (𝐹𝑥))
4241sseq1d 3230 . . . . . . . 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 2578 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥)) → ∀𝑥𝐾 (𝐹𝑥) ∈ 𝐽))
4746imdistanda 448 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(𝐹𝑥))) → (𝐹:𝑋𝑌 ∧ ∀𝑥𝐾 (𝐹𝑥) ∈ 𝐽)))
48 iscn 14784 . . 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 1373  wcel 2178  wral 2486  wss 3174  𝒫 cpw 3626   cuni 3864  ccnv 4692  dom cdm 4693  cima 4696  wf 5286  cfv 5290  (class class class)co 5967  Topctop 14584  TopOnctopon 14597  intcnt 14680   Cn ccn 14772
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-map 6760  df-top 14585  df-topon 14598  df-ntr 14683  df-cn 14775
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator