Theorem cnfval 22130

Description: The set of all continuous functions from topology 𝐽 to topology 𝐾. (Contributed by NM, 17-Oct-2006.) (Revised by Mario Carneiro, 21-Aug-2015.)

Assertion

Ref	Expression
cnfval	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽})

Distinct variable groups:   𝑦,𝑓,𝐾   𝑓,𝑋,𝑦   𝑓,𝑌,𝑦   𝑓,𝐽,𝑦

Proof of Theorem cnfval

Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-cn 22124	. . 3 ⊢ Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 (◡𝑓 “ 𝑦) ∈ 𝑗})
2	1	a1i 11	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → Cn = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 (◡𝑓 “ 𝑦) ∈ 𝑗}))
3		simprr 773	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑘 = 𝐾)
4	3	unieqd 4833	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑘 = ∪ 𝐾)
5		toponuni 21811	. . . . . 6 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝐾)
6	5	ad2antlr 727	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑌 = ∪ 𝐾)
7	4, 6	eqtr4d 2780	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑘 = 𝑌)
8		simprl 771	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑗 = 𝐽)
9	8	unieqd 4833	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑗 = ∪ 𝐽)
10		toponuni 21811	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
11	10	ad2antrr 726	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑋 = ∪ 𝐽)
12	9, 11	eqtr4d 2780	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑗 = 𝑋)
13	7, 12	oveq12d 7231	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → (∪ 𝑘 ↑m ∪ 𝑗) = (𝑌 ↑m 𝑋))
14	8	eleq2d 2823	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ((◡𝑓 “ 𝑦) ∈ 𝑗 ↔ (◡𝑓 “ 𝑦) ∈ 𝐽))
15	3, 14	raleqbidv 3313	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → (∀𝑦 ∈ 𝑘 (◡𝑓 “ 𝑦) ∈ 𝑗 ↔ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽))
16	13, 15	rabeqbidv 3396	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑦 ∈ 𝑘 (◡𝑓 “ 𝑦) ∈ 𝑗} = {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽})
17		topontop 21810	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
18	17	adantr 484	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐽 ∈ Top)
19		topontop 21810	. . 3 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
20	19	adantl 485	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐾 ∈ Top)
21		ovex 7246	. . . 4 ⊢ (𝑌 ↑m 𝑋) ∈ V
22	21	rabex 5225	. . 3 ⊢ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽} ∈ V
23	22	a1i 11	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽} ∈ V)
24	2, 16, 18, 20, 23	ovmpod 7361	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 Cn 𝐾) = {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑦 ∈ 𝐾 (◡𝑓 “ 𝑦) ∈ 𝐽})

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1543   ∈ wcel 2110  ∀wral 3061  {crab 3065  Vcvv 3408  ∪ cuni 4819  ^◡ccnv 5550   “ cima 5554  ‘cfv 6380  (class class class)co 7213   ∈ cmpo 7215   ↑_m cmap 8508  Topctop 21790  TopOnctopon 21807   Cn ccn 22121

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-sbc 3695  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-mpt 5136  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-iota 6338  df-fun 6382  df-fv 6388  df-ov 7216  df-oprab 7217  df-mpo 7218  df-topon 21808  df-cn 22124

This theorem is referenced by:  iscn  22132  cnfex  42244