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

Theorem cnpval 23179
Description: The set of all functions from topology 𝐽 to topology 𝐾 that are continuous at a point 𝑃. (Contributed by NM, 17-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Assertion
Ref Expression
cnpval ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
Distinct variable groups:   𝑥,𝑓,𝑦,𝐽   𝑓,𝐾,𝑥,𝑦   𝑓,𝑋,𝑥,𝑦   𝑃,𝑓,𝑥,𝑦   𝑓,𝑌,𝑥,𝑦

Proof of Theorem cnpval
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 cnpfval 23177 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}))
21fveq1d 6883 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃))
3 fveq2 6881 . . . . . . . 8 (𝑣 = 𝑃 → (𝑓𝑣) = (𝑓𝑃))
43eleq1d 2820 . . . . . . 7 (𝑣 = 𝑃 → ((𝑓𝑣) ∈ 𝑦 ↔ (𝑓𝑃) ∈ 𝑦))
5 eleq1 2823 . . . . . . . . 9 (𝑣 = 𝑃 → (𝑣𝑥𝑃𝑥))
65anbi1d 631 . . . . . . . 8 (𝑣 = 𝑃 → ((𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
76rexbidv 3165 . . . . . . 7 (𝑣 = 𝑃 → (∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
84, 7imbi12d 344 . . . . . 6 (𝑣 = 𝑃 → (((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
98ralbidv 3164 . . . . 5 (𝑣 = 𝑃 → (∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
109rabbidv 3428 . . . 4 (𝑣 = 𝑃 → {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} = {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
11 eqid 2736 . . . 4 (𝑣𝑋 ↦ {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
12 ovex 7443 . . . . 5 (𝑌m 𝑋) ∈ V
1312rabex 5314 . . . 4 {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} ∈ V
1410, 11, 13fvmpt 6991 . . 3 (𝑃𝑋 → ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃) = {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
152, 14sylan9eq 2791 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
16153impa 1109 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3052  wrex 3061  {crab 3420  wss 3931  cmpt 5206  cima 5662  cfv 6536  (class class class)co 7410  m cmap 8845  TopOnctopon 22853   CnP ccnp 23168
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-sbc 3771  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-top 22837  df-topon 22854  df-cnp 23171
This theorem is referenced by:  iscnp  23180
  Copyright terms: Public domain W3C validator