Theorem cnntr 23283

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

Step	Hyp	Ref	Expression
1		cnf2 23257	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋⟶𝑌)
2	1	3expia 1122	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶𝑌))
3		elpwi 4607	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑌 → 𝑥 ⊆ 𝑌)
4	3	adantl 481	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 ⊆ 𝑌)
5		toponuni 22920	. . . . . . 7 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝐾)
6	5	ad2antlr 727	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = ∪ 𝐾)
7	4, 6	sseqtrd 4020	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 ⊆ ∪ 𝐾)
8		eqid 2737	. . . . . . 7 ⊢ ∪ 𝐾 = ∪ 𝐾
9	8	cnntri 23279	. . . . . 6 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ⊆ ∪ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))
10	9	expcom 413	. . . . 5 ⊢ (𝑥 ⊆ ∪ 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
11	7, 10	syl 17	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
12	11	ralrimdva 3154	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
13	2, 12	jcad 512	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))))
14		toponss 22933	. . . . . . . . . 10 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
15		velpw 4605	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝒫 𝑌 ↔ 𝑥 ⊆ 𝑌)
16	14, 15	sylibr 234	. . . . . . . . 9 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ∈ 𝒫 𝑌)
17	16	ex 412	. . . . . . . 8 ⊢ (𝐾 ∈ (TopOn‘𝑌) → (𝑥 ∈ 𝐾 → 𝑥 ∈ 𝒫 𝑌))
18	17	ad2antlr 727	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (𝑥 ∈ 𝐾 → 𝑥 ∈ 𝒫 𝑌))
19	18	imim1d 82	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ 𝒫 𝑌 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → (𝑥 ∈ 𝐾 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))))
20		topontop 22919	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
21	20	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ Top)
22		cnvimass 6100	. . . . . . . . . . 11 ⊢ (◡𝐹 “ 𝑥) ⊆ dom 𝐹
23		fdm 6745	. . . . . . . . . . . . 13 ⊢ (𝐹:𝑋⟶𝑌 → dom 𝐹 = 𝑋)
24	23	ad2antlr 727	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → dom 𝐹 = 𝑋)
25		toponuni 22920	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
26	25	ad3antrrr 730	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑋 = ∪ 𝐽)
27	24, 26	eqtrd 2777	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → dom 𝐹 = ∪ 𝐽)
28	22, 27	sseqtrid 4026	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ⊆ ∪ 𝐽)
29		eqid 2737	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
30	29	ntrss2 23065	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝑥) ⊆ ∪ 𝐽) → ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥))
31	21, 28, 30	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥))
32		eqss 3999	. . . . . . . . . 10 ⊢ (((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥) ↔ (((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥) ∧ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
33	32	baib 535	. . . . . . . . 9 ⊢ (((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥) → (((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥) ↔ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
34	31, 33	syl 17	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → (((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥) ↔ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
35	29	isopn3 23074	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝑥) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥)))
36	21, 28, 35	syl2anc 584	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ 𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥)))
37		topontop 22919	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
38	37	ad3antlr 731	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐾 ∈ Top)
39		isopn3i 23090	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ Top ∧ 𝑥 ∈ 𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
40	38, 39	sylancom 588	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
41	40	imaeq2d 6078	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) = (◡𝐹 “ 𝑥))
42	41	sseq1d 4015	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ↔ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
43	34, 36, 42	3bitr4rd 312	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ↔ (◡𝐹 “ 𝑥) ∈ 𝐽))
44	43	pm5.74da 804	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ 𝐾 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) ↔ (𝑥 ∈ 𝐾 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
45	19, 44	sylibd 239	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ 𝒫 𝑌 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → (𝑥 ∈ 𝐾 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
46	45	ralimdv2 3163	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) → ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽))
47	46	imdistanda 571	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽)))
48		iscn 23243	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽)))
49	47, 48	sylibrd 259	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → 𝐹 ∈ (𝐽 Cn 𝐾)))
50	13, 49	impbid 212	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∀wral 3061   ⊆ wss 3951  𝒫 cpw 4600  ∪ cuni 4907  ^◡ccnv 5684  dom cdm 5685   “ cima 5688  ⟶wf 6557  ‘cfv 6561  (class class class)co 7431  Topctop 22899  TopOnctopon 22916  intcnt 23025   Cn ccn 23232

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-map 8868  df-top 22900  df-topon 22917  df-ntr 23028  df-cn 23235

This theorem is referenced by: (None)