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

Theorem iscnp2 23550
Description: The predicate "the class 𝐹 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 4286 . . . . . . 7 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ¬ ((𝐽 CnP 𝐾)‘𝑃) = ∅)
2 df-ov 7421 . . . . . . . . . 10 (𝐽 CnP 𝐾) = ( CnP ‘⟨𝐽, 𝐾⟩)
3 ndmfv 6915 . . . . . . . . . 10 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ( CnP ‘⟨𝐽, 𝐾⟩) = ∅)
42, 3eqtrid 2808 . . . . . . . . 9 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → (𝐽 CnP 𝐾) = ∅)
54fveq1d 6885 . . . . . . . 8 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = (∅‘𝑃))
6 0fv 6924 . . . . . . . 8 (∅‘𝑃) = ∅
75, 6eqtrdi 2812 . . . . . . 7 (¬ ⟨𝐽, 𝐾⟩ ∈ dom CnP → ((𝐽 CnP 𝐾)‘𝑃) = ∅)
81, 7nsyl2 142 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ dom CnP )
9 df-cnp 23539 . . . . . . 7 CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))}))
10 ovex 7451 . . . . . . . . . . 11 (∪ 𝑘 ↑m ∪ 𝑗) ∈ V
11 ssrab2 4028 . . . . . . . . . . 11 {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))} ⊆ (∪ 𝑘 ↑m ∪ 𝑗)
1210, 11elpwi2 5297 . . . . . . . . . 10 {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))} ∈ 𝒫 (∪ 𝑘 ↑m ∪ 𝑗)
1312rgenw 3081 . . . . . . . . 9 ∀𝑥 ∈ ∪ 𝑗{𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))} ∈ 𝒫 (∪ 𝑘 ↑m ∪ 𝑗)
14 eqid 2761 . . . . . . . . . 10 (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))}) = (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))})
1514fmpt 7108 . . . . . . . . 9 (∀𝑥 ∈ ∪ 𝑗{𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))} ∈ 𝒫 (∪ 𝑘 ↑m ∪ 𝑗) ↔ (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))}):∪ 𝑗⟶𝒫 (∪ 𝑘 ↑m ∪ 𝑗))
1613, 15mpbi 233 . . . . . . . 8 (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))}):∪ 𝑗⟶𝒫 (∪ 𝑘 ↑m ∪ 𝑗)
17 vuniex 7754 . . . . . . . 8 ∪ 𝑗 ∈ V
1810pwex 5342 . . . . . . . 8 𝒫 (∪ 𝑘 ↑m ∪ 𝑗) ∈ V
19 fex2 7946 . . . . . . . 8 (((𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))}):∪ 𝑗⟶𝒫 (∪ 𝑘 ↑m ∪ 𝑗) ∧ ∪ 𝑗 ∈ V ∧ 𝒫 (∪ 𝑘 ↑m ∪ 𝑗) ∈ V) → (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))}) ∈ V)
2016, 17, 18, 19mp3an 1490 . . . . . . 7 (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑦 → ∃𝑔 ∈ 𝑗 (𝑥 ∈ 𝑔 ∧ (𝑓 “ 𝑔) ⊆ 𝑦))}) ∈ V
219, 20dmmpo 8080 . . . . . 6 dom CnP = (Top × Top)
228, 21eleqtrdi 2871 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → ⟨𝐽, 𝐾⟩ ∈ (Top × Top))
23 opelxp 5687 . . . . 5 (⟨𝐽, 𝐾⟩ ∈ (Top × Top) ↔ (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2422, 23sylib 221 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top))
2524simpld 500 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
2624simprd 501 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
27 elfvdm 6917 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃 ∈ dom (𝐽 CnP 𝐾))
28 iscn.1 . . . . . . . . 9 𝑋 = ∪ 𝐽
2928toptopon 23228 . . . . . . . 8 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
30 iscn.2 . . . . . . . . 9 𝑌 = ∪ 𝐾
3130toptopon 23228 . . . . . . . 8 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
32 cnpfval 23545 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))
3329, 31, 32syl2anb 610 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 CnP 𝐾) = (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))
3424, 33syl 18 . . . . . 6 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 CnP 𝐾) = (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))
3534dmeqd 5887 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = dom (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))
36 ovex 7451 . . . . . . . 8 (𝑌 ↑m 𝑋) ∈ V
3736rabex 5300 . . . . . . 7 {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))} ∈ V
3837rgenw 3081 . . . . . 6 ∀𝑥 ∈ 𝑋 {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))} ∈ V
39 dmmptg 6242 . . . . . 6 (∀𝑥 ∈ 𝑋 {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))} ∈ V → dom (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}) = 𝑋)
4038, 39ax-mp 5 . . . . 5 dom (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}) = 𝑋
4135, 40eqtrdi 2812 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → dom (𝐽 CnP 𝐾) = 𝑋)
4227, 41eleqtrd 2863 . . 3 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃 ∈ 𝑋)
4325, 26, 423jca 1146 . 2 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃 ∈ 𝑋))
44 biid 264 . . 3 (𝑃 ∈ 𝑋 ↔ 𝑃 ∈ 𝑋)
45 iscnp 23548 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
4629, 31, 44, 45syl3anb 1179 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
4743, 46biadanii 834 1 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑃 ∈ 𝑋) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  {crab 3413  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ⟨cop 4590  ∪ cuni 4867   ↦ cmpt 5186   × cxp 5649  dom cdm 5651   “ cima 5654  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   ↑m cmap 8840  Topctop 23204  TopOnctopon 23221   CnP ccnp 23536
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-map 8842  df-top 23205  df-topon 23222  df-cnp 23539
This theorem is used by:  cnptop1  23553  cnptop2  23554  cnprcl  23556  cnpf  23558  cnpimaex  23567  cnpnei  23575  cnpco  23578  cnprest  23600  cnprest2  23601
  Copyright terms: Public domain W3C validator