Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cnneiima Structured version   Visualization version   GIF version

Theorem cnneiima 50452
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
StepHypRef Expression
1 cnneiima.3 . . . 4 (𝜑 → 𝑆 ⊆ (◡𝐹 “ 𝑇))
2 cnneiima.1 . . . . . . 7 (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
3 eqid 2766 . . . . . . . 8 ∪ 𝐽 = ∪ 𝐽
4 eqid 2766 . . . . . . . 8 ∪ 𝐾 = ∪ 𝐾
53, 4cnf 23621 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
62, 5syl 18 . . . . . 6 (𝜑 → 𝐹:∪ 𝐽⟶∪ 𝐾)
76ffund 6743 . . . . 5 (𝜑 → Fun 𝐹)
8 cnneiima.2 . . . . . 6 (𝜑 → 𝑁 ∈ ((nei‘𝐾)‘𝑇))
9 cntop2 23616 . . . . . . . 8 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
102, 9syl 18 . . . . . . 7 (𝜑 → 𝐾 ∈ Top)
114neiss2 23476 . . . . . . . 8 ((𝐾 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐾)‘𝑇)) → 𝑇 ⊆ ∪ 𝐾)
1210, 8, 11syl2anc 596 . . . . . . 7 (𝜑 → 𝑇 ⊆ ∪ 𝐾)
134neii1 23481 . . . . . . . 8 ((𝐾 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐾)‘𝑇)) → 𝑁 ⊆ ∪ 𝐾)
1410, 8, 13syl2anc 596 . . . . . . 7 (𝜑 → 𝑁 ⊆ ∪ 𝐾)
154neiint 23479 . . . . . . 7 ((𝐾 ∈ Top ∧ 𝑇 ⊆ ∪ 𝐾 ∧ 𝑁 ⊆ ∪ 𝐾) → (𝑁 ∈ ((nei‘𝐾)‘𝑇) ↔ 𝑇 ⊆ ((int‘𝐾)‘𝑁)))
1610, 12, 14, 15syl3anc 1401 . . . . . 6 (𝜑 → (𝑁 ∈ ((nei‘𝐾)‘𝑇) ↔ 𝑇 ⊆ ((int‘𝐾)‘𝑁)))
178, 16mpbid 235 . . . . 5 (𝜑 → 𝑇 ⊆ ((int‘𝐾)‘𝑁))
18 sspreima 7098 . . . . 5 ((Fun 𝐹 ∧ 𝑇 ⊆ ((int‘𝐾)‘𝑁)) → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ((int‘𝐾)‘𝑁)))
197, 17, 18syl2anc 596 . . . 4 (𝜑 → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ((int‘𝐾)‘𝑁)))
201, 19sstrd 3922 . . 3 (𝜑 → 𝑆 ⊆ (◡𝐹 “ ((int‘𝐾)‘𝑁)))
214cnntri 23646 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑁 ⊆ ∪ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑁)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁)))
222, 14, 21syl2anc 596 . . 3 (𝜑 → (◡𝐹 “ ((int‘𝐾)‘𝑁)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁)))
2320, 22sstrd 3922 . 2 (𝜑 → 𝑆 ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁)))
24 cntop1 23615 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
252, 24syl 18 . . 3 (𝜑 → 𝐽 ∈ Top)
26 sspreima 7098 . . . . . 6 ((Fun 𝐹 ∧ 𝑇 ⊆ ∪ 𝐾) → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ∪ 𝐾))
277, 12, 26syl2anc 596 . . . . 5 (𝜑 → (◡𝐹 “ 𝑇) ⊆ (◡𝐹 “ ∪ 𝐾))
28 fimacnv 6761 . . . . . 6 (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ ∪ 𝐾) = ∪ 𝐽)
296, 28syl 18 . . . . 5 (𝜑 → (◡𝐹 “ ∪ 𝐾) = ∪ 𝐽)
3027, 29sseqtrd 3948 . . . 4 (𝜑 → (◡𝐹 “ 𝑇) ⊆ ∪ 𝐽)
311, 30sstrd 3922 . . 3 (𝜑 → 𝑆 ⊆ ∪ 𝐽)
32 sspreima 7098 . . . . 5 ((Fun 𝐹 ∧ 𝑁 ⊆ ∪ 𝐾) → (◡𝐹 “ 𝑁) ⊆ (◡𝐹 “ ∪ 𝐾))
337, 14, 32syl2anc 596 . . . 4 (𝜑 → (◡𝐹 “ 𝑁) ⊆ (◡𝐹 “ ∪ 𝐾))
3433, 29sseqtrd 3948 . . 3 (𝜑 → (◡𝐹 “ 𝑁) ⊆ ∪ 𝐽)
353neiint 23479 . . 3 ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽 ∧ (◡𝐹 “ 𝑁) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝑁) ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁))))
3625, 31, 34, 35syl3anc 1401 . 2 (𝜑 → ((◡𝐹 “ 𝑁) ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑁))))
3723, 36mpbird 260 1 (𝜑 → (◡𝐹 “ 𝑁) ∈ ((nei‘𝐽)‘𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1572   ∈ wcel 2150   ⊆ wss 3899  ∪ cuni 4871  ◡ccnv 5656   “ cima 5660  Fun wfun 6559  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450  Topctop 23268  intcnt 23392  neicnei 23472   Cn ccn 23599
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-map 8886  df-top 23269  df-topon 23286  df-ntr 23395  df-nei 23473  df-cn 23602
This theorem is used by:  sepfsepc  50463
  Copyright terms: Public domain W3C validator