Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  iscnp2 Structured version   Visualization version   GIF version

Theorem iscnp2 21245
 Description: The predicate "𝐹 is a continuous function from topology 𝐽 to topology 𝐾 at point 𝑃." Based on Theorem 7.2(g) of [Munkres] p. 107. (Contributed by Mario Carneiro, 21-Aug-2015.)
Hypotheses
Ref Expression
iscn.1 𝑋 = 𝐽
iscn.2 𝑌 = 𝐾
Assertion
Ref Expression
iscnp2 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) ∧ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝐾,𝑦   𝑥,𝑋,𝑦   𝑥,𝐹,𝑦   𝑥,𝑃,𝑦   𝑥,𝑌,𝑦

Proof of Theorem iscnp2
Dummy variables 𝑓 𝑔 𝑗 𝑘 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 n0i 4063 . . . . . . 7 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ¬ ((𝐽 CnP 𝐾)‘𝑃) = ∅)
2 df-ov 6816 . . . . . . . . . 10 (𝐽 CnP 𝐾) = ( CnP ‘⟨𝐽, 𝐾⟩)
3 ndmfv 6379 . . . . . . . . . 10 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ( CnP ‘⟨𝐽, 𝐾⟩) = ∅)
42, 3syl5eq 2806 . . . . . . . . 9 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → (𝐽 CnP 𝐾) = ∅)
54fveq1d 6354 . . . . . . . 8 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = (∅‘𝑃))
6 0fv 6388 . . . . . . . 8 (∅‘𝑃) = ∅
75, 6syl6eq 2810 . . . . . . 7 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = ∅)
81, 7nsyl2 142 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ dom CnP )
9 df-cnp 21234 . . . . . . 7 CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}))
10 ssrab2 3828 . . . . . . . . . . 11 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗)
11 ovex 6841 . . . . . . . . . . . 12 ( 𝑘𝑚 𝑗) ∈ V
1211elpw2 4977 . . . . . . . . . . 11 ({𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗))
1310, 12mpbir 221 . . . . . . . . . 10 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
1413rgenw 3062 . . . . . . . . 9 𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
15 eqid 2760 . . . . . . . . . 10 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) = (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))})
1615fmpt 6544 . . . . . . . . 9 (∀𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗))
1714, 16mpbi 220 . . . . . . . 8 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗)
18 vuniex 7119 . . . . . . . 8 𝑗 ∈ V
1911pwex 4997 . . . . . . . 8 𝒫 ( 𝑘𝑚 𝑗) ∈ V
20 fex2 7286 . . . . . . . 8 (((𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗) ∧ 𝑗 ∈ V ∧ 𝒫 ( 𝑘𝑚 𝑗) ∈ V) → (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V)
2117, 18, 19, 20mp3an 1573 . . . . . . 7 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V
229, 21dmmpt2 7408 . . . . . 6 dom CnP = (Top × Top)
238, 22syl6eleq 2849 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ (Top × Top))
24 opelxp 5303 . . . . 5 (⟨𝐽, 𝐾⟩ ∈ (Top × Top) ↔ (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2523, 24sylib 208 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2625simpld 477 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
2725simprd 482 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
28 elfvdm 6381 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃 ∈ dom (𝐽 CnP 𝐾))
29 iscn.1 . . . . . . . . 9 𝑋 = 𝐽
3029toptopon 20924 . . . . . . . 8 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
31 iscn.2 . . . . . . . . 9 𝑌 = 𝐾
3231toptopon 20924 . . . . . . . 8 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
33 cnpfval 21240 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3430, 32, 33syl2anb 497 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3525, 34syl 17 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3635dmeqd 5481 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
37 ovex 6841 . . . . . . . 8 (𝑌𝑚 𝑋) ∈ V
3837rabex 4964 . . . . . . 7 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
3938rgenw 3062 . . . . . 6 𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
40 dmmptg 5793 . . . . . 6 (∀𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V → dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋)
4139, 40ax-mp 5 . . . . 5 dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋
4236, 41syl6eq 2810 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = 𝑋)
4328, 42eleqtrd 2841 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃𝑋)
4426, 27, 433jca 1123 . 2 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋))
45 biid 251 . . 3 (𝑃𝑋𝑃𝑋)
46 iscnp 21243 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4730, 32, 45, 46syl3anb 1165 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4844, 47biadan2 677 1 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) ∧ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 383   ∧ w3a 1072   = wceq 1632   ∈ wcel 2139  ∀wral 3050  ∃wrex 3051  {crab 3054  Vcvv 3340   ⊆ wss 3715  ∅c0 4058  𝒫 cpw 4302  ⟨cop 4327  ∪ cuni 4588   ↦ cmpt 4881   × cxp 5264  dom cdm 5266   “ cima 5269  ⟶wf 6045  ‘cfv 6049  (class class class)co 6813   ↑𝑚 cmap 8023  Topctop 20900  TopOnctopon 20917   CnP ccnp 21231 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-fv 6057  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-1st 7333  df-2nd 7334  df-map 8025  df-top 20901  df-topon 20918  df-cnp 21234 This theorem is referenced by:  cnptop1  21248  cnptop2  21249  cnprcl  21251  cnpf  21253  cnpimaex  21262  cnpnei  21270  cnpco  21273  cnprest  21295  cnprest2  21296
 Copyright terms: Public domain W3C validator