Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cnfex Structured version   Visualization version   GIF version

Theorem cnfex 44966
Description: The class of continuous functions between two topologies is a set. (Contributed by Glauco Siliprandi, 20-Apr-2017.)
Assertion
Ref Expression
cnfex ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) ∈ V)

Proof of Theorem cnfex
Dummy variables 𝑦 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2735 . . . . 5 𝐽 = 𝐽
21jctr 524 . . . 4 (𝐽 ∈ Top → (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
3 istopon 22934 . . . 4 (𝐽 ∈ (TopOn‘ 𝐽) ↔ (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
42, 3sylibr 234 . . 3 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘ 𝐽))
5 eqid 2735 . . . . 5 𝐾 = 𝐾
65jctr 524 . . . 4 (𝐾 ∈ Top → (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
7 istopon 22934 . . . 4 (𝐾 ∈ (TopOn‘ 𝐾) ↔ (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
86, 7sylibr 234 . . 3 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘ 𝐾))
9 cnfval 23257 . . 3 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
104, 8, 9syl2an 596 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
11 uniexg 7759 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ V)
12 uniexg 7759 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ V)
13 mapvalg 8875 . . . . 5 (( 𝐾 ∈ V ∧ 𝐽 ∈ V) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
1411, 12, 13syl2anr 597 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
15 mapex 7962 . . . . 5 (( 𝐽 ∈ V ∧ 𝐾 ∈ V) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1612, 11, 15syl2an 596 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1714, 16eqeltrd 2839 . . 3 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) ∈ V)
18 rabexg 5343 . . 3 (( 𝐾m 𝐽) ∈ V → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
1917, 18syl 17 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
2010, 19eqeltrd 2839 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  {cab 2712  wral 3059  {crab 3433  Vcvv 3478   cuni 4912  ccnv 5688  cima 5692  wf 6559  cfv 6563  (class class class)co 7431  m cmap 8865  Topctop 22915  TopOnctopon 22932   Cn ccn 23248
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-map 8867  df-topon 22933  df-cn 23251
This theorem is referenced by:  stoweidlem53  46009  stoweidlem57  46013
  Copyright terms: Public domain W3C validator