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 45310
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 22858 . . . 4 (𝐽 ∈ (TopOn‘ 𝐽) ↔ (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
42, 3sylibr 234 . . 3 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘ 𝐽))
5 eqid 2735 . . . . 5 𝐾 = 𝐾
65jctr 524 . . . 4 (𝐾 ∈ Top → (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
7 istopon 22858 . . . 4 (𝐾 ∈ (TopOn‘ 𝐾) ↔ (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
86, 7sylibr 234 . . 3 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘ 𝐾))
9 cnfval 23179 . . 3 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
104, 8, 9syl2an 597 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
11 uniexg 7685 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ V)
12 uniexg 7685 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ V)
13 mapvalg 8775 . . . . 5 (( 𝐾 ∈ V ∧ 𝐽 ∈ V) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
1411, 12, 13syl2anr 598 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
15 mapex 7883 . . . . 5 (( 𝐽 ∈ V ∧ 𝐾 ∈ V) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1612, 11, 15syl2an 597 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1714, 16eqeltrd 2835 . . 3 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) ∈ V)
18 rabexg 5281 . . 3 (( 𝐾m 𝐽) ∈ V → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
1917, 18syl 17 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
2010, 19eqeltrd 2835 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2713  wral 3050  {crab 3398  Vcvv 3439   cuni 4862  ccnv 5622  cima 5626  wf 6487  cfv 6491  (class class class)co 7358  m cmap 8765  Topctop 22839  TopOnctopon 22856   Cn ccn 23170
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-sbc 3740  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-fv 6499  df-ov 7361  df-oprab 7362  df-mpo 7363  df-map 8767  df-topon 22857  df-cn 23173
This theorem is referenced by:  stoweidlem53  46334  stoweidlem57  46338
  Copyright terms: Public domain W3C validator