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 42460
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 2738 . . . . 5 𝐽 = 𝐽
21jctr 524 . . . 4 (𝐽 ∈ Top → (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
3 istopon 21969 . . . 4 (𝐽 ∈ (TopOn‘ 𝐽) ↔ (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
42, 3sylibr 233 . . 3 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘ 𝐽))
5 eqid 2738 . . . . 5 𝐾 = 𝐾
65jctr 524 . . . 4 (𝐾 ∈ Top → (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
7 istopon 21969 . . . 4 (𝐾 ∈ (TopOn‘ 𝐾) ↔ (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
86, 7sylibr 233 . . 3 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘ 𝐾))
9 cnfval 22292 . . 3 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
104, 8, 9syl2an 595 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
11 uniexg 7571 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ V)
12 uniexg 7571 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ V)
13 mapvalg 8583 . . . . 5 (( 𝐾 ∈ V ∧ 𝐽 ∈ V) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
1411, 12, 13syl2anr 596 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
15 mapex 8579 . . . . 5 (( 𝐽 ∈ V ∧ 𝐾 ∈ V) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1612, 11, 15syl2an 595 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1714, 16eqeltrd 2839 . . 3 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) ∈ V)
18 rabexg 5250 . . 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 1539  wcel 2108  {cab 2715  wral 3063  {crab 3067  Vcvv 3422   cuni 4836  ccnv 5579  cima 5583  wf 6414  cfv 6418  (class class class)co 7255  m cmap 8573  Topctop 21950  TopOnctopon 21967   Cn ccn 22283
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-map 8575  df-topon 21968  df-cn 22286
This theorem is referenced by:  stoweidlem53  43484  stoweidlem57  43488
  Copyright terms: Public domain W3C validator