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 45849
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 2762 . . . . 5 𝐽 = 𝐽
21jctr 534 . . . 4 (𝐽 ∈ Top → (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
3 istopon 23138 . . . 4 (𝐽 ∈ (TopOn‘ 𝐽) ↔ (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
42, 3sylibr 237 . . 3 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘ 𝐽))
5 eqid 2762 . . . . 5 𝐾 = 𝐾
65jctr 534 . . . 4 (𝐾 ∈ Top → (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
7 istopon 23138 . . . 4 (𝐾 ∈ (TopOn‘ 𝐾) ↔ (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
86, 7sylibr 237 . . 3 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘ 𝐾))
9 cnfval 23459 . . 3 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
104, 8, 9syl2an 608 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
11 uniexg 7745 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ V)
12 uniexg 7745 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ V)
13 mapvalg 8838 . . . . 5 (( 𝐾 ∈ V ∧ 𝐽 ∈ V) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
1411, 12, 13syl2anr 609 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
15 mapex 7940 . . . . 5 (( 𝐽 ∈ V ∧ 𝐾 ∈ V) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1612, 11, 15syl2an 608 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1714, 16eqeltrd 2862 . . 3 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) ∈ V)
18 rabexg 5306 . . 3 (( 𝐾m 𝐽) ∈ V → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
1917, 18syl 18 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
2010, 19eqeltrd 2862 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  {cab 2740  wral 3078  {crab 3414  Vcvv 3453   cuni 4870  ccnv 5658  cima 5662  wf 6533  cfv 6537  (class class class)co 7416  m cmap 8829  Topctop 23119  TopOnctopon 23136   Cn ccn 23450
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-map 8831  df-topon 23137  df-cn 23453
This theorem is used by:  stoweidlem53  46868  stoweidlem57  46872
  Copyright terms: Public domain W3C validator