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

Theorem iscnp2 20853
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 3879 . . . . . . 7 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ¬ ((𝐽 CnP 𝐾)‘𝑃) = ∅)
2 df-ov 6552 . . . . . . . . . 10 (𝐽 CnP 𝐾) = ( CnP ‘⟨𝐽, 𝐾⟩)
3 ndmfv 6128 . . . . . . . . . 10 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ( CnP ‘⟨𝐽, 𝐾⟩) = ∅)
42, 3syl5eq 2656 . . . . . . . . 9 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → (𝐽 CnP 𝐾) = ∅)
54fveq1d 6105 . . . . . . . 8 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = (∅‘𝑃))
6 0fv 6137 . . . . . . . 8 (∅‘𝑃) = ∅
75, 6syl6eq 2660 . . . . . . 7 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = ∅)
81, 7nsyl2 141 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ dom CnP )
9 df-cnp 20842 . . . . . . 7 CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}))
10 ssrab2 3650 . . . . . . . . . . 11 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗)
11 ovex 6577 . . . . . . . . . . . 12 ( 𝑘𝑚 𝑗) ∈ V
1211elpw2 4755 . . . . . . . . . . 11 ({𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗))
1310, 12mpbir 220 . . . . . . . . . 10 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
1413rgenw 2908 . . . . . . . . 9 𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
15 eqid 2610 . . . . . . . . . 10 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) = (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))})
1615fmpt 6289 . . . . . . . . 9 (∀𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗))
1714, 16mpbi 219 . . . . . . . 8 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗)
18 vuniex 6852 . . . . . . . 8 𝑗 ∈ V
1911pwex 4774 . . . . . . . 8 𝒫 ( 𝑘𝑚 𝑗) ∈ V
20 fex2 7014 . . . . . . . 8 (((𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗) ∧ 𝑗 ∈ V ∧ 𝒫 ( 𝑘𝑚 𝑗) ∈ V) → (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V)
2117, 18, 19, 20mp3an 1416 . . . . . . 7 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V
229, 21dmmpt2 7129 . . . . . 6 dom CnP = (Top × Top)
238, 22syl6eleq 2698 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ (Top × Top))
24 opelxp 5070 . . . . 5 (⟨𝐽, 𝐾⟩ ∈ (Top × Top) ↔ (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2523, 24sylib 207 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2625simpld 474 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
2725simprd 478 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
28 elfvdm 6130 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃 ∈ dom (𝐽 CnP 𝐾))
29 iscn.1 . . . . . . . . 9 𝑋 = 𝐽
3029toptopon 20548 . . . . . . . 8 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
31 iscn.2 . . . . . . . . 9 𝑌 = 𝐾
3231toptopon 20548 . . . . . . . 8 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
33 cnpfval 20848 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3430, 32, 33syl2anb 495 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3525, 34syl 17 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3635dmeqd 5248 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
37 ovex 6577 . . . . . . . 8 (𝑌𝑚 𝑋) ∈ V
3837rabex 4740 . . . . . . 7 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
3938rgenw 2908 . . . . . 6 𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
40 dmmptg 5549 . . . . . 6 (∀𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V → dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋)
4139, 40ax-mp 5 . . . . 5 dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋
4236, 41syl6eq 2660 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = 𝑋)
4328, 42eleqtrd 2690 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃𝑋)
4426, 27, 433jca 1235 . 2 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋))
45 biid 250 . . 3 (𝑃𝑋𝑃𝑋)
46 iscnp 20851 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4730, 32, 45, 46syl3anb 1361 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4844, 47biadan2 672 1 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) ∧ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wral 2896  wrex 2897  {crab 2900  Vcvv 3173  wss 3540  c0 3874  𝒫 cpw 4108  cop 4131   cuni 4372  cmpt 4643   × cxp 5036  dom cdm 5038  cima 5041  wf 5800  cfv 5804  (class class class)co 6549  𝑚 cmap 7744  Topctop 20517  TopOnctopon 20518   CnP ccnp 20839
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-map 7746  df-top 20521  df-topon 20523  df-cnp 20842
This theorem is referenced by:  cnptop1  20856  cnptop2  20857  cnprcl  20859  cnpf  20861  cnpimaex  20870  cnpnei  20878  cnpco  20881  cnprest  20903  cnprest2  20904
  Copyright terms: Public domain W3C validator