Theorem cnfex 45776

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 2762	. . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽
2	1	jctr 533	. . . 4 ⊢ (𝐽 ∈ Top → (𝐽 ∈ Top ∧ ∪ 𝐽 = ∪ 𝐽))
3		istopon 23080	. . . 4 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) ↔ (𝐽 ∈ Top ∧ ∪ 𝐽 = ∪ 𝐽))
4	2, 3	sylibr 237	. . 3 ⊢ (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘∪ 𝐽))
5		eqid 2762	. . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾
6	5	jctr 533	. . . 4 ⊢ (𝐾 ∈ Top → (𝐾 ∈ Top ∧ ∪ 𝐾 = ∪ 𝐾))
7		istopon 23080	. . . 4 ⊢ (𝐾 ∈ (TopOn‘∪ 𝐾) ↔ (𝐾 ∈ Top ∧ ∪ 𝐾 = ∪ 𝐾))
8	6, 7	sylibr 237	. . 3 ⊢ (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘∪ 𝐾))
9		cnfval 23401	. . 3 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽})
10	4, 8, 9	syl2an 607	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) = {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽})
11		uniexg 7740	. . . . 5 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ V)
12		uniexg 7740	. . . . 5 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
13		mapvalg 8831	. . . . 5 ⊢ ((∪ 𝐾 ∈ V ∧ ∪ 𝐽 ∈ V) → (∪ 𝐾 ↑m ∪ 𝐽) = {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾})
14	11, 12, 13	syl2anr 608	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (∪ 𝐾 ↑m ∪ 𝐽) = {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾})
15		mapex 7935	. . . . 5 ⊢ ((∪ 𝐽 ∈ V ∧ ∪ 𝐾 ∈ V) → {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾} ∈ V)
16	12, 11, 15	syl2an 607	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∣ 𝑓:∪ 𝐽⟶∪ 𝐾} ∈ V)
17	14, 16	eqeltrd 2862	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (∪ 𝐾 ↑m ∪ 𝐽) ∈ V)
18		rabexg 5307	. . 3 ⊢ ((∪ 𝐾 ↑m ∪ 𝐽) ∈ V → {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽} ∈ V)
19	17, 18	syl 18	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → {𝑓 ∈ (∪ 𝐾 ↑m ∪ 𝐽) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽} ∈ V)
20	10, 19	eqeltrd 2862	1 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 Cn 𝐾) ∈ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  {cab 2740  ∀wral 3078  {crab 3415  Vcvv 3454  ∪ cuni 4871  ^◡ccnv 5659   “ cima 5663  ⟶wf 6532  ‘cfv 6536  (class class class)co 7412   ↑_m cmap 8822  Topctop 23061  TopOnctopon 23078   Cn ccn 23392

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  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 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8824  df-topon 23079  df-cn 23395

This theorem is used by:  stoweidlem53  46795  stoweidlem57  46799