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

Theorem iscnp2 21253
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 4118 . . . . . . 7 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ¬ ((𝐽 CnP 𝐾)‘𝑃) = ∅)
2 df-ov 6874 . . . . . . . . . 10 (𝐽 CnP 𝐾) = ( CnP ‘⟨𝐽, 𝐾⟩)
3 ndmfv 6435 . . . . . . . . . 10 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ( CnP ‘⟨𝐽, 𝐾⟩) = ∅)
42, 3syl5eq 2851 . . . . . . . . 9 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → (𝐽 CnP 𝐾) = ∅)
54fveq1d 6407 . . . . . . . 8 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = (∅‘𝑃))
6 0fv 6444 . . . . . . . 8 (∅‘𝑃) = ∅
75, 6syl6eq 2855 . . . . . . 7 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = ∅)
81, 7nsyl2 144 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ dom CnP )
9 df-cnp 21242 . . . . . . 7 CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}))
10 ssrab2 3881 . . . . . . . . . . 11 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗)
11 ovex 6903 . . . . . . . . . . . 12 ( 𝑘𝑚 𝑗) ∈ V
1211elpw2 5017 . . . . . . . . . . 11 ({𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗))
1310, 12mpbir 222 . . . . . . . . . 10 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
1413rgenw 3111 . . . . . . . . 9 𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
15 eqid 2805 . . . . . . . . . 10 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) = (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))})
1615fmpt 6599 . . . . . . . . 9 (∀𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗))
1714, 16mpbi 221 . . . . . . . 8 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗)
18 vuniex 7181 . . . . . . . 8 𝑗 ∈ V
1911pwex 5047 . . . . . . . 8 𝒫 ( 𝑘𝑚 𝑗) ∈ V
20 fex2 7348 . . . . . . . 8 (((𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗) ∧ 𝑗 ∈ V ∧ 𝒫 ( 𝑘𝑚 𝑗) ∈ V) → (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V)
2117, 18, 19, 20mp3an 1578 . . . . . . 7 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V
229, 21dmmpt2 7470 . . . . . 6 dom CnP = (Top × Top)
238, 22syl6eleq 2894 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ (Top × Top))
24 opelxp 5343 . . . . 5 (⟨𝐽, 𝐾⟩ ∈ (Top × Top) ↔ (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2523, 24sylib 209 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2625simpld 484 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
2725simprd 485 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
28 elfvdm 6437 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃 ∈ dom (𝐽 CnP 𝐾))
29 iscn.1 . . . . . . . . 9 𝑋 = 𝐽
3029toptopon 20931 . . . . . . . 8 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
31 iscn.2 . . . . . . . . 9 𝑌 = 𝐾
3231toptopon 20931 . . . . . . . 8 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
33 cnpfval 21248 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3430, 32, 33syl2anb 587 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3525, 34syl 17 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3635dmeqd 5524 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
37 ovex 6903 . . . . . . . 8 (𝑌𝑚 𝑋) ∈ V
3837rabex 5004 . . . . . . 7 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
3938rgenw 3111 . . . . . 6 𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
40 dmmptg 5843 . . . . . 6 (∀𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V → dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋)
4139, 40ax-mp 5 . . . . 5 dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋
4236, 41syl6eq 2855 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = 𝑋)
4328, 42eleqtrd 2886 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃𝑋)
4426, 27, 433jca 1151 . 2 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋))
45 biid 252 . . 3 (𝑃𝑋𝑃𝑋)
46 iscnp 21251 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4730, 32, 45, 46syl3anb 1193 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4844, 47biadan2 844 1 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) ∧ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197  wa 384  w3a 1100   = wceq 1637  wcel 2158  wral 3095  wrex 3096  {crab 3099  Vcvv 3390  wss 3766  c0 4113  𝒫 cpw 4348  cop 4373   cuni 4626  cmpt 4919   × cxp 5306  dom cdm 5308  cima 5311  wf 6094  cfv 6098  (class class class)co 6871  𝑚 cmap 8089  Topctop 20907  TopOnctopon 20924   CnP ccnp 21239
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1880  ax-4 1897  ax-5 2004  ax-6 2070  ax-7 2106  ax-8 2160  ax-9 2167  ax-10 2187  ax-11 2203  ax-12 2216  ax-13 2422  ax-ext 2784  ax-sep 4971  ax-nul 4980  ax-pow 5032  ax-pr 5093  ax-un 7176
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1865  df-sb 2063  df-eu 2636  df-mo 2637  df-clab 2792  df-cleq 2798  df-clel 2801  df-nfc 2936  df-ne 2978  df-ral 3100  df-rex 3101  df-rab 3104  df-v 3392  df-sbc 3631  df-csb 3726  df-dif 3769  df-un 3771  df-in 3773  df-ss 3780  df-nul 4114  df-if 4277  df-pw 4350  df-sn 4368  df-pr 4370  df-op 4374  df-uni 4627  df-iun 4710  df-br 4841  df-opab 4903  df-mpt 4920  df-id 5216  df-xp 5314  df-rel 5315  df-cnv 5316  df-co 5317  df-dm 5318  df-rn 5319  df-res 5320  df-ima 5321  df-iota 6061  df-fun 6100  df-fn 6101  df-f 6102  df-fv 6106  df-ov 6874  df-oprab 6875  df-mpt2 6876  df-1st 7395  df-2nd 7396  df-map 8091  df-top 20908  df-topon 20925  df-cnp 21242
This theorem is referenced by:  cnptop1  21256  cnptop2  21257  cnprcl  21259  cnpf  21261  cnpimaex  21270  cnpnei  21278  cnpco  21281  cnprest  21303  cnprest2  21304
  Copyright terms: Public domain W3C validator