Theorem cnntr 22509

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 22483	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋⟶𝑌)
2	1	3expia 1120	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶𝑌))
3		elpwi 4552	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑌 → 𝑥 ⊆ 𝑌)
4	3	adantl 482	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 ⊆ 𝑌)
5		toponuni 22146	. . . . . . 7 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝐾)
6	5	ad2antlr 724	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑌 = ∪ 𝐾)
7	4, 6	sseqtrd 3971	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → 𝑥 ⊆ ∪ 𝐾)
8		eqid 2737	. . . . . . 7 ⊢ ∪ 𝐾 = ∪ 𝐾
9	8	cnntri 22505	. . . . . 6 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ⊆ ∪ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))
10	9	expcom 414	. . . . 5 ⊢ (𝑥 ⊆ ∪ 𝐾 → (𝐹 ∈ (𝐽 Cn 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
11	7, 10	syl 17	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝒫 𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
12	11	ralrimdva 3148	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
13	2, 12	jcad 513	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))))
14		toponss 22159	. . . . . . . . . 10 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
15		velpw 4550	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝒫 𝑌 ↔ 𝑥 ⊆ 𝑌)
16	14, 15	sylibr 233	. . . . . . . . 9 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ∈ 𝒫 𝑌)
17	16	ex 413	. . . . . . . 8 ⊢ (𝐾 ∈ (TopOn‘𝑌) → (𝑥 ∈ 𝐾 → 𝑥 ∈ 𝒫 𝑌))
18	17	ad2antlr 724	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (𝑥 ∈ 𝐾 → 𝑥 ∈ 𝒫 𝑌))
19	18	imim1d 82	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ 𝒫 𝑌 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → (𝑥 ∈ 𝐾 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))))
20		topontop 22145	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
21	20	ad3antrrr 727	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ Top)
22		cnvimass 6007	. . . . . . . . . . 11 ⊢ (◡𝐹 “ 𝑥) ⊆ dom 𝐹
23		fdm 6647	. . . . . . . . . . . . 13 ⊢ (𝐹:𝑋⟶𝑌 → dom 𝐹 = 𝑋)
24	23	ad2antlr 724	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → dom 𝐹 = 𝑋)
25		toponuni 22146	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
26	25	ad3antrrr 727	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑋 = ∪ 𝐽)
27	24, 26	eqtrd 2777	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → dom 𝐹 = ∪ 𝐽)
28	22, 27	sseqtrid 3983	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ⊆ ∪ 𝐽)
29		eqid 2737	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
30	29	ntrss2 22291	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝑥) ⊆ ∪ 𝐽) → ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥))
31	21, 28, 30	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥))
32		eqss 3946	. . . . . . . . . 10 ⊢ (((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥) ↔ (((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥) ∧ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
33	32	baib 536	. . . . . . . . 9 ⊢ (((int‘𝐽)‘(◡𝐹 “ 𝑥)) ⊆ (◡𝐹 “ 𝑥) → (((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥) ↔ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
34	31, 33	syl 17	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → (((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥) ↔ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
35	29	isopn3 22300	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝑥) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥)))
36	21, 28, 35	syl2anc 584	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ 𝑥) ∈ 𝐽 ↔ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) = (◡𝐹 “ 𝑥)))
37		topontop 22145	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
38	37	ad3antlr 728	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐾 ∈ Top)
39		isopn3i 22316	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ Top ∧ 𝑥 ∈ 𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
40	38, 39	sylancom 588	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((int‘𝐾)‘𝑥) = 𝑥)
41	40	imaeq2d 5987	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑥)) = (◡𝐹 “ 𝑥))
42	41	sseq1d 3962	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ↔ (◡𝐹 “ 𝑥) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))))
43	34, 36, 42	3bitr4rd 311	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑥 ∈ 𝐾) → ((◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) ↔ (◡𝐹 “ 𝑥) ∈ 𝐽))
44	43	pm5.74da 801	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ 𝐾 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) ↔ (𝑥 ∈ 𝐾 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
45	19, 44	sylibd 238	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → ((𝑥 ∈ 𝒫 𝑌 → (◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → (𝑥 ∈ 𝐾 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
46	45	ralimdv2 3157	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋⟶𝑌) → (∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)) → ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽))
47	46	imdistanda 572	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽)))
48		iscn 22469	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽)))
49	47, 48	sylibrd 258	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥))) → 𝐹 ∈ (𝐽 Cn 𝐾)))
50	13, 49	impbid 211	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝒫 𝑌(◡𝐹 “ ((int‘𝐾)‘𝑥)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑥)))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1540   ∈ wcel 2105  ∀wral 3062   ⊆ wss 3897  𝒫 cpw 4545  ∪ cuni 4850  ^◡ccnv 5607  dom cdm 5608   “ cima 5611  ⟶wf 6462  ‘cfv 6466  (class class class)co 7317  Topctop 22125  TopOnctopon 22142  intcnt 22251   Cn ccn 22458

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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2708  ax-rep 5224  ax-sep 5238  ax-nul 5245  ax-pow 5303  ax-pr 5367  ax-un 7630

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3351  df-rab 3405  df-v 3443  df-sbc 3727  df-csb 3843  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4268  df-if 4472  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4851  df-iun 4939  df-br 5088  df-opab 5150  df-mpt 5171  df-id 5507  df-xp 5614  df-rel 5615  df-cnv 5616  df-co 5617  df-dm 5618  df-rn 5619  df-res 5620  df-ima 5621  df-iota 6418  df-fun 6468  df-fn 6469  df-f 6470  df-f1 6471  df-fo 6472  df-f1o 6473  df-fv 6474  df-ov 7320  df-oprab 7321  df-mpo 7322  df-map 8667  df-top 22126  df-topon 22143  df-ntr 22254  df-cn 22461

This theorem is referenced by: (None)