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

Theorem cnpval 15222
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 15219 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}))
21fveq1d 5692 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃))
32adantr 276 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃))
4 eqid 2238 . . . 4 (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))}) = (𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
5 fveq2 5690 . . . . . . . 8 (𝑣 = 𝑃 → (𝑓𝑣) = (𝑓𝑃))
65eleq1d 2307 . . . . . . 7 (𝑣 = 𝑃 → ((𝑓𝑣) ∈ 𝑦 ↔ (𝑓𝑃) ∈ 𝑦))
7 eleq1 2301 . . . . . . . . 9 (𝑣 = 𝑃 → (𝑣𝑥𝑃𝑥))
87anbi1d 469 . . . . . . . 8 (𝑣 = 𝑃 → ((𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
98rexbidv 2551 . . . . . . 7 (𝑣 = 𝑃 → (∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦) ↔ ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)))
106, 9imbi12d 234 . . . . . 6 (𝑣 = 𝑃 → (((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
1110ralbidv 2550 . . . . 5 (𝑣 = 𝑃 → (∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦)) ↔ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))))
1211rabbidv 2810 . . . 4 (𝑣 = 𝑃 → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
13 simpr 110 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑃𝑋)
14 fnmap 6919 . . . . . 6 𝑚 Fn (V × V)
15 toponmax 15049 . . . . . . . 8 (𝐾 ∈ (TopOn‘𝑌) → 𝑌𝐾)
1615elexd 2835 . . . . . . 7 (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ V)
1716ad2antlr 493 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑌 ∈ V)
18 toponmax 15049 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
1918elexd 2835 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ V)
2019ad2antrr 492 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → 𝑋 ∈ V)
21 fnovex 6108 . . . . . 6 (( ↑𝑚 Fn (V × V) ∧ 𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝑌𝑚 𝑋) ∈ V)
2214, 17, 20, 21mp3an2i 1383 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → (𝑌𝑚 𝑋) ∈ V)
23 rabexg 4274 . . . . 5 ((𝑌𝑚 𝑋) ∈ V → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} ∈ V)
2422, 23syl 14 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))} ∈ V)
254, 12, 13, 24fvmptd3 5793 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝑣𝑋 ↦ {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑣) ∈ 𝑦 → ∃𝑥𝐽 (𝑣𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
263, 25eqtrd 2271 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
27263impa 1225 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ∀𝑦𝐾 ((𝑓𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑓𝑥) ⊆ 𝑦))})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1009   = wceq 1402  wcel 2209  wral 2528  wrex 2529  {crab 2532  Vcvv 2821  wss 3220  cmpt 4187   × cxp 4767  cima 4772   Fn wfn 5367  cfv 5372  (class class class)co 6075  𝑚 cmap 6912  TopOnctopon 15034   CnP ccnp 15210
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-map 6914  df-top 15022  df-topon 15035  df-cnp 15213
This theorem is referenced by:  iscnp  15223
  Copyright terms: Public domain W3C validator