Theorem cnpfval 23360

Description: The function mapping the points in a topology 𝐽 to the set of all functions from 𝐽 to topology 𝐾 continuous at that point. (Contributed by NM, 17-Oct-2006.) (Revised by Mario Carneiro, 21-Aug-2015.)

Assertion

Ref	Expression
cnpfval	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))

Distinct variable groups:   𝑤,𝑓,𝑥,𝐾   𝑓,𝑋,𝑤,𝑥   𝑓,𝑌,𝑤,𝑥   𝑣,𝑓,𝐽,𝑤,𝑥

Allowed substitution hints:   𝐾(𝑣)   𝑋(𝑣)   𝑌(𝑣)

Proof of Theorem cnpfval

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

Step	Hyp	Ref	Expression
1		df-cnp 23354	. . 3 ⊢ CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑤 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝑗 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))
2	1	a1i 11	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → CnP = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑤 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝑗 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))})))
3		simprl 782	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑗 = 𝐽)
4	3	unieqd 4889	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑗 = ∪ 𝐽)
5		toponuni 23040	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
6	5	ad2antrr 738	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑋 = ∪ 𝐽)
7	4, 6	eqtr4d 2807	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑗 = 𝑋)
8		simprr 784	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑘 = 𝐾)
9	8	unieqd 4889	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑘 = ∪ 𝐾)
10		toponuni 23040	. . . . . . 7 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝐾)
11	10	ad2antlr 739	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → 𝑌 = ∪ 𝐾)
12	9, 11	eqtr4d 2807	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → ∪ 𝑘 = 𝑌)
13	12, 7	oveq12d 7429	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → (∪ 𝑘 ↑m ∪ 𝑗) = (𝑌 ↑m 𝑋))
14	3	rexeqdv 3330	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → (∃𝑣 ∈ 𝑗 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤) ↔ ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤)))
15	14	imbi2d 343	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → (((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝑗 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤)) ↔ ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))))
16	8, 15	raleqbidv 3345	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → (∀𝑤 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝑗 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤)) ↔ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))))
17	13, 16	rabeqbidv 3441	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑤 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝑗 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))} = {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))})
18	7, 17	mpteq12dv 5202	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ (𝑗 = 𝐽 ∧ 𝑘 = 𝐾)) → (𝑥 ∈ ∪ 𝑗 ↦ {𝑓 ∈ (∪ 𝑘 ↑m ∪ 𝑗) ∣ ∀𝑤 ∈ 𝑘 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝑗 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}) = (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))
19		topontop 23039	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
20	19	adantr 485	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐽 ∈ Top)
21		topontop 23039	. . 3 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
22	21	adantl 486	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝐾 ∈ Top)
23		ovex 7444	. . . . . 6 ⊢ (𝑌 ↑m 𝑋) ∈ V
24		ssrab2 4042	. . . . . 6 ⊢ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))} ⊆ (𝑌 ↑m 𝑋)
25	23, 24	elpwi2 5306	. . . . 5 ⊢ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))} ∈ 𝒫 (𝑌 ↑m 𝑋)
26	25	a1i 11	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑥 ∈ 𝑋) → {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))} ∈ 𝒫 (𝑌 ↑m 𝑋))
27	26	fmpttd 7111	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}):𝑋⟶𝒫 (𝑌 ↑m 𝑋))
28		toponmax 23052	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
29	28	adantr 485	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝑋 ∈ 𝐽)
30	23	pwex 5352	. . . 4 ⊢ 𝒫 (𝑌 ↑m 𝑋) ∈ V
31	30	a1i 11	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → 𝒫 (𝑌 ↑m 𝑋) ∈ V)
32		fex2 7933	. . 3 ⊢ (((𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}):𝑋⟶𝒫 (𝑌 ↑m 𝑋) ∧ 𝑋 ∈ 𝐽 ∧ 𝒫 (𝑌 ↑m 𝑋) ∈ V) → (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}) ∈ V)
33	27, 29, 31, 32	syl3anc 1396	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}) ∈ V)
34	2, 18, 20, 22, 33	ovmpod 7563	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑥 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑤 ∈ 𝐾 ((𝑓‘𝑥) ∈ 𝑤 → ∃𝑣 ∈ 𝐽 (𝑥 ∈ 𝑣 ∧ (𝑓 “ 𝑣) ⊆ 𝑤))}))

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085  ∃wrex 3095  {crab 3423  Vcvv 3463   ⊆ wss 3913  𝒫 cpw 4567  ∪ cuni 4876   ↦ cmpt 5196   “ cima 5665  ⟶wf 6533  ‘cfv 6537  (class class class)co 7411   ∈ cmpo 7413   ↑_m cmap 8824  Topctop 23019  TopOnctopon 23036   CnP ccnp 23351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-top 23020  df-topon 23037  df-cnp 23354

This theorem is referenced by:  cnpval  23362  iscnp2  23365  cnambfre  38207