Theorem cnneiima 49198

Description: Given a continuous function, the preimage of a neighborhood is a neighborhood. To be precise, the preimage of a neighborhood of a subset 𝑇 of the codomain of a continuous function is a neighborhood of any subset of the preimage of 𝑇. (Contributed by Zhi Wang, 9-Sep-2024.)

Hypotheses

Ref	Expression
cnneiima.1	⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
cnneiima.2	⊢ (𝜑 → 𝑁 ∈ ((nei‘𝐾)‘𝑇))
cnneiima.3	⊢ (𝜑 → 𝑆 ⊆ (◡𝐹 “ 𝑇))

Assertion

Ref	Expression
cnneiima	⊢ (𝜑 → (◡𝐹 “ 𝑁) ∈ ((nei‘𝐽)‘𝑆))

Proof of Theorem cnneiima

Step	Hyp	Ref	Expression
1		cnneiima.3	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ (◡𝐹 “ 𝑇))
2		cnneiima.1	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
3		eqid 2737	. . . . . . . 8 ⊢ ∪ 𝐽 = ∪ 𝐽
4		eqid 2737	. . . . . . . 8 ⊢ ∪ 𝐾 = ∪ 𝐾
5	3, 4	cnf 23194	. . . . . . 7 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
6	2, 5	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐹:∪ 𝐽⟶∪ 𝐾)
7	6	ffund 6667	. . . . 5 ⊢ (𝜑 → Fun 𝐹)
8		cnneiima.2	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ((nei‘𝐾)‘𝑇))
9		cntop2 23189	. . . . . . . 8 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
10	2, 9	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
11	4	neiss2 23049	. . . . . . . 8 ⊢ ((𝐾 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐾)‘𝑇)) → 𝑇 ⊆ ∪ 𝐾)
12	10, 8, 11	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → 𝑇 ⊆ ∪ 𝐾)
13	4	neii1 23054	. . . . . . . 8 ⊢ ((𝐾 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐾)‘𝑇)) → 𝑁 ⊆ ∪ 𝐾)
14	10, 8, 13	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → 𝑁 ⊆ ∪ 𝐾)
15	4	neiint 23052	. . . . . . 7 ⊢ ((𝐾 ∈ Top ∧ 𝑇 ⊆ ∪ 𝐾 ∧ 𝑁 ⊆ ∪ 𝐾) → (𝑁 ∈ ((nei‘𝐾)‘𝑇) ↔ 𝑇 ⊆ ((int‘𝐾)‘𝑁)))
16	10, 12, 14, 15	syl3anc 1374	. . . . . 6 ⊢ (𝜑 → (𝑁 ∈ ((nei‘𝐾)‘𝑇) ↔ 𝑇 ⊆ ((int‘𝐾)‘𝑁)))
17	8, 16	mpbid 232	. . . . 5 ⊢ (𝜑 → 𝑇 ⊆ ((int‘𝐾)‘𝑁))
18		sspreima 7015	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝑇 ⊆ ((int‘𝐾)‘𝑁)) → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ((int‘𝐾)‘𝑁)))
19	7, 17, 18	syl2anc 585	. . . 4 ⊢ (𝜑 → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ((int‘𝐾)‘𝑁)))
20	1, 19	sstrd 3945	. . 3 ⊢ (𝜑 → 𝑆 ⊆ (◡𝐹 “ ((int‘𝐾)‘𝑁)))
21	4	cnntri 23219	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑁 ⊆ ∪ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑁)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁)))
22	2, 14, 21	syl2anc 585	. . 3 ⊢ (𝜑 → (◡𝐹 “ ((int‘𝐾)‘𝑁)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁)))
23	20, 22	sstrd 3945	. 2 ⊢ (𝜑 → 𝑆 ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁)))
24		cntop1 23188	. . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
25	2, 24	syl 17	. . 3 ⊢ (𝜑 → 𝐽 ∈ Top)
26		sspreima 7015	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝑇 ⊆ ∪ 𝐾) → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ∪ 𝐾))
27	7, 12, 26	syl2anc 585	. . . . 5 ⊢ (𝜑 → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ∪ 𝐾))
28		fimacnv 6685	. . . . . 6 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ ∪ 𝐾) = ∪ 𝐽)
29	6, 28	syl 17	. . . . 5 ⊢ (𝜑 → (◡𝐹 “ ∪ 𝐾) = ∪ 𝐽)
30	27, 29	sseqtrd 3971	. . . 4 ⊢ (𝜑 → (◡𝐹 “ 𝑇) ⊆ ∪ 𝐽)
31	1, 30	sstrd 3945	. . 3 ⊢ (𝜑 → 𝑆 ⊆ ∪ 𝐽)
32		sspreima 7015	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝑁 ⊆ ∪ 𝐾) → (◡𝐹 “ 𝑁) ⊆ (◡𝐹 “ ∪ 𝐾))
33	7, 14, 32	syl2anc 585	. . . 4 ⊢ (𝜑 → (◡𝐹 “ 𝑁) ⊆ (◡𝐹 “ ∪ 𝐾))
34	33, 29	sseqtrd 3971	. . 3 ⊢ (𝜑 → (◡𝐹 “ 𝑁) ⊆ ∪ 𝐽)
35	3	neiint 23052	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽 ∧ (◡𝐹 “ 𝑁) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝑁) ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁))))
36	25, 31, 34, 35	syl3anc 1374	. 2 ⊢ (𝜑 → ((◡𝐹 “ 𝑁) ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁))))
37	23, 36	mpbird 257	1 ⊢ (𝜑 → (◡𝐹 “ 𝑁) ∈ ((nei‘𝐽)‘𝑆))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114   ⊆ wss 3902  ∪ cuni 4864  ^◡ccnv 5624   “ cima 5628  Fun wfun 6487  ⟶wf 6489  ‘cfv 6493  (class class class)co 7360  Topctop 22841  intcnt 22965  neicnei 23045   Cn ccn 23172

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-map 8769  df-top 22842  df-topon 22859  df-ntr 22968  df-nei 23046  df-cn 23175

This theorem is referenced by:  sepfsepc  49209