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 45022
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 2729 . . . . 5 𝐽 = 𝐽
21jctr 524 . . . 4 (𝐽 ∈ Top → (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
3 istopon 22799 . . . 4 (𝐽 ∈ (TopOn‘ 𝐽) ↔ (𝐽 ∈ Top ∧ 𝐽 = 𝐽))
42, 3sylibr 234 . . 3 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘ 𝐽))
5 eqid 2729 . . . . 5 𝐾 = 𝐾
65jctr 524 . . . 4 (𝐾 ∈ Top → (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
7 istopon 22799 . . . 4 (𝐾 ∈ (TopOn‘ 𝐾) ↔ (𝐾 ∈ Top ∧ 𝐾 = 𝐾))
86, 7sylibr 234 . . 3 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘ 𝐾))
9 cnfval 23120 . . 3 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
104, 8, 9syl2an 596 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) = {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽})
11 uniexg 7716 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ V)
12 uniexg 7716 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ V)
13 mapvalg 8809 . . . . 5 (( 𝐾 ∈ V ∧ 𝐽 ∈ V) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
1411, 12, 13syl2anr 597 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) = {𝑓𝑓: 𝐽 𝐾})
15 mapex 7917 . . . . 5 (( 𝐽 ∈ V ∧ 𝐾 ∈ V) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1612, 11, 15syl2an 596 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓𝑓: 𝐽 𝐾} ∈ V)
1714, 16eqeltrd 2828 . . 3 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ( 𝐾m 𝐽) ∈ V)
18 rabexg 5292 . . 3 (( 𝐾m 𝐽) ∈ V → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
1917, 18syl 17 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∈ ( 𝐾m 𝐽) ∣ ∀𝑦𝐾 (𝑓𝑦) ∈ 𝐽} ∈ V)
2010, 19eqeltrd 2828 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  {cab 2707  wral 3044  {crab 3405  Vcvv 3447   cuni 4871  ccnv 5637  cima 5641  wf 6507  cfv 6511  (class class class)co 7387  m cmap 8799  Topctop 22780  TopOnctopon 22797   Cn ccn 23111
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-map 8801  df-topon 22798  df-cn 23114
This theorem is referenced by:  stoweidlem53  46051  stoweidlem57  46055
  Copyright terms: Public domain W3C validator