ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnpval GIF version

Theorem cnpval 14377
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 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
Distinct variable groups:   𝑥,𝑓,𝑦,𝐽   𝑓,𝐾,𝑥,𝑦   𝑓,𝑋,𝑥,𝑦   𝑃,𝑓,𝑥,𝑦   𝑓,𝑌,𝑥,𝑦

Proof of Theorem cnpval
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 cnpfval 14374 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}))
21fveq1d 5557 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃))
32adantr 276 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃))
4 eqid 2193 . . . 4 (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
5 fveq2 5555 . . . . . . . 8 (𝑣 = 𝑃 → (𝑓𝑣) = (𝑓𝑃))
65eleq1d 2262 . . . . . . 7 (𝑣 = 𝑃 → ((𝑓𝑣) ∈ 𝑦 ↔ (𝑓𝑃) ∈ 𝑦))
7 eleq1 2256 . . . . . . . . 9 (𝑣 = 𝑃 → (𝑣𝑥𝑃𝑥))
87anbi1d 465 . . . . . . . 8 (𝑣 = 𝑃 → ((𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
98rexbidv 2495 . . . . . . 7 (𝑣 = 𝑃 → (∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
106, 9imbi12d 234 . . . . . 6 (𝑣 = 𝑃 → (((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
1110ralbidv 2494 . . . . 5 (𝑣 = 𝑃 → (∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
1211rabbidv 2749 . . . 4 (𝑣 = 𝑃 → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
13 simpr 110 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑃𝑋)
14 fnmap 6711 . . . . . 6 𝑚 Fn (V × V)
15 toponmax 14204 . . . . . . . 8 (𝐾 ∈ (TopOn‘𝑌) → 𝑌𝐾)
1615elexd 2773 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ V)
1716ad2antlr 489 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑌 ∈ V)
18 toponmax 14204 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
1918elexd 2773 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ V)
2019ad2antrr 488 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑋 ∈ V)
21 fnovex 5952 . . . . . 6 (( ↑𝑚 Fn (V × V) ∧ 𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝑌𝑚 𝑋) ∈ V)
2214, 17, 20, 21mp3an2i 1353 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → (𝑌𝑚 𝑋) ∈ V)
23 rabexg 4173 . . . . 5 ((𝑌𝑚 𝑋) ∈ V → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} ∈ V)
2422, 23syl 14 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} ∈ V)
254, 12, 13, 24fvmptd3 5652 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
263, 25eqtrd 2226 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
27263impa 1196 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2164  wral 2472  wrex 2473  {crab 2476  Vcvv 2760  wss 3154  cmpt 4091   × cxp 4658  cima 4663   Fn wfn 5250  cfv 5255  (class class class)co 5919  𝑚 cmap 6704  TopOnctopon 14189   CnP ccnp 14365
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-map 6706  df-top 14177  df-topon 14190  df-cnp 14368
This theorem is referenced by:  iscnp  14378
  Copyright terms: Public domain W3C validator