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

Theorem iscnp2 20953
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 3896 . . . . . . 7 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ¬ ((𝐽 CnP 𝐾)‘𝑃) = ∅)
2 df-ov 6607 . . . . . . . . . 10 (𝐽 CnP 𝐾) = ( CnP ‘⟨𝐽, 𝐾⟩)
3 ndmfv 6175 . . . . . . . . . 10 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ( CnP ‘⟨𝐽, 𝐾⟩) = ∅)
42, 3syl5eq 2667 . . . . . . . . 9 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → (𝐽 CnP 𝐾) = ∅)
54fveq1d 6150 . . . . . . . 8 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = (∅‘𝑃))
6 0fv 6184 . . . . . . . 8 (∅‘𝑃) = ∅
75, 6syl6eq 2671 . . . . . . 7 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = ∅)
81, 7nsyl2 142 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ dom CnP )
9 df-cnp 20942 . . . . . . 7 CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}))
10 ssrab2 3666 . . . . . . . . . . 11 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗)
11 ovex 6632 . . . . . . . . . . . 12 ( 𝑘𝑚 𝑗) ∈ V
1211elpw2 4788 . . . . . . . . . . 11 ({𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ⊆ ( 𝑘𝑚 𝑗))
1310, 12mpbir 221 . . . . . . . . . 10 {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
1413rgenw 2919 . . . . . . . . 9 𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗)
15 eqid 2621 . . . . . . . . . 10 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) = (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))})
1615fmpt 6337 . . . . . . . . 9 (∀𝑥 𝑗{𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))} ∈ 𝒫 ( 𝑘𝑚 𝑗) ↔ (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗))
1714, 16mpbi 220 . . . . . . . 8 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗)
18 vuniex 6907 . . . . . . . 8 𝑗 ∈ V
1911pwex 4808 . . . . . . . 8 𝒫 ( 𝑘𝑚 𝑗) ∈ V
20 fex2 7068 . . . . . . . 8 (((𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}): 𝑗⟶𝒫 ( 𝑘𝑚 𝑗) ∧ 𝑗 ∈ V ∧ 𝒫 ( 𝑘𝑚 𝑗) ∈ V) → (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V)
2117, 18, 19, 20mp3an 1421 . . . . . . 7 (𝑥 𝑗 ↦ {𝑓 ∈ ( 𝑘𝑚 𝑗) ∣ ∀𝑦𝑘 ((𝑓𝑥) ∈ 𝑦 → ∃𝑔𝑗 (𝑥𝑔 ∧ (𝑓𝑔) ⊆ 𝑦))}) ∈ V
229, 21dmmpt2 7185 . . . . . 6 dom CnP = (Top × Top)
238, 22syl6eleq 2708 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ (Top × Top))
24 opelxp 5106 . . . . 5 (⟨𝐽, 𝐾⟩ ∈ (Top × Top) ↔ (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2523, 24sylib 208 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2625simpld 475 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
2725simprd 479 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
28 elfvdm 6177 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃 ∈ dom (𝐽 CnP 𝐾))
29 iscn.1 . . . . . . . . 9 𝑋 = 𝐽
3029toptopon 20648 . . . . . . . 8 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
31 iscn.2 . . . . . . . . 9 𝑌 = 𝐾
3231toptopon 20648 . . . . . . . 8 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
33 cnpfval 20948 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3430, 32, 33syl2anb 496 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3525, 34syl 17 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 CnP 𝐾) = (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
3635dmeqd 5286 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}))
37 ovex 6632 . . . . . . . 8 (𝑌𝑚 𝑋) ∈ V
3837rabex 4773 . . . . . . 7 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
3938rgenw 2919 . . . . . 6 𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V
40 dmmptg 5591 . . . . . 6 (∀𝑥𝑋 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))} ∈ V → dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋)
4139, 40ax-mp 5 . . . . 5 dom (𝑥𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑤𝐾 ((𝑓𝑥) ∈ 𝑤 → ∃𝑣𝐽 (𝑥𝑣 ∧ (𝑓𝑣) ⊆ 𝑤))}) = 𝑋
4236, 41syl6eq 2671 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = 𝑋)
4328, 42eleqtrd 2700 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃𝑋)
4426, 27, 433jca 1240 . 2 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋))
45 biid 251 . . 3 (𝑃𝑋𝑃𝑋)
46 iscnp 20951 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4730, 32, 45, 46syl3anb 1366 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
4844, 47biadan2 673 1 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃𝑋) ∧ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384  w3a 1036   = wceq 1480  wcel 1987  wral 2907  wrex 2908  {crab 2911  Vcvv 3186  wss 3555  c0 3891  𝒫 cpw 4130  cop 4154   cuni 4402  cmpt 4673   × cxp 5072  dom cdm 5074  cima 5077  wf 5843  cfv 5847  (class class class)co 6604  𝑚 cmap 7802  Topctop 20617  TopOnctopon 20618   CnP ccnp 20939
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-fv 5855  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-1st 7113  df-2nd 7114  df-map 7804  df-top 20621  df-topon 20623  df-cnp 20942
This theorem is referenced by:  cnptop1  20956  cnptop2  20957  cnprcl  20959  cnpf  20961  cnpimaex  20970  cnpnei  20978  cnpco  20981  cnprest  21003  cnprest2  21004
  Copyright terms: Public domain W3C validator