Theorem cnfex 45966

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.

Step	Hyp	Ref	Expression
1		eqid 2760	. . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽
2	1	jctr 534	. . . 4 ⊢ (𝐽 ∈ Top → (𝐽 ∈ Top ∧ ∪ 𝐽 = ∪ 𝐽))
3		istopon 23191	. . . 4 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) ↔ (𝐽 ∈ Top ∧ ∪ 𝐽 = ∪ 𝐽))
4	2, 3	sylibr 237	. . 3 ⊢ (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘∪ 𝐽))
5		eqid 2760	. . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾
6	5	jctr 534	. . . 4 ⊢ (𝐾 ∈ Top → (𝐾 ∈ Top ∧ ∪ 𝐾 = ∪ 𝐾))
7		istopon 23191	. . . 4 ⊢ (𝐾 ∈ (TopOn‘∪ 𝐾) ↔ (𝐾 ∈ Top ∧ ∪ 𝐾 = ∪ 𝐾))
8	6, 7	sylibr 237	. . 3 ⊢ (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘∪ 𝐾))
9		cnfval 23512	. . 3 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽})
10	4, 8, 9	syl2an 608	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) = {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽})
11		uniexg 7740	. . . . 5 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ V)
12		uniexg 7740	. . . . 5 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
13		mapvalg 8834	. . . . 5 ⊢ ((∪ 𝐾 ∈ V ∧ ∪ 𝐽 ∈ V) → (∪ 𝐾 ↑m ∪ 𝐽) = {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾})
14	11, 12, 13	syl2anr 609	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (∪ 𝐾 ↑m ∪ 𝐽) = {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾})
15		mapex 7935	. . . . 5 ⊢ ((∪ 𝐽 ∈ V ∧ ∪ 𝐾 ∈ V) → {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾} ∈ V)
16	12, 11, 15	syl2an 608	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾} ∈ V)
17	14, 16	eqeltrd 2860	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (∪ 𝐾 ↑m ∪ 𝐽) ∈ V)
18		rabexg 5298	. . 3 ⊢ ((∪ 𝐾 ↑m ∪ 𝐽) ∈ V → {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽} ∈ V)
19	17, 18	syl 18	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽} ∈ V)
20	10, 19	eqeltrd 2860	1 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) ∈ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  ∀wral 3076  {crab 3412  Vcvv 3450  ∪ cuni 4866  ^◡ccnv 5646   “ cima 5650  ⟶wf 6523  ‘cfv 6527  (class class class)co 7408   ↑_m cmap 8825  Topctop 23172  TopOnctopon 23189   Cn ccn 23503

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 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-map 8827  df-topon 23190  df-cn 23506

This theorem is used by:  stoweidlem53  46985  stoweidlem57  46989