Theorem cnpval 15299

Description: The set of all functions from topology 𝐽 to topology 𝐾 that are continuous at a point 𝑃. (Contributed by NM, 17-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)

Assertion

Ref	Expression
cnpval	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})

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

Proof of Theorem cnpval

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnpfval 15296	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐽 CnP 𝐾) = (𝑣 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))}))
2	1	fveq1d 5697	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})‘𝑃))
3	2	adantr 276	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = ((𝑣 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})‘𝑃))
4		eqid 2238	. . . 4 ⊢ (𝑣 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))}) = (𝑣 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})
5		fveq2 5695	. . . . . . . 8 ⊢ (𝑣 = 𝑃 → (𝑓‘𝑣) = (𝑓‘𝑃))
6	5	eleq1d 2307	. . . . . . 7 ⊢ (𝑣 = 𝑃 → ((𝑓‘𝑣) ∈ 𝑦 ↔ (𝑓‘𝑃) ∈ 𝑦))
7		eleq1 2301	. . . . . . . . 9 ⊢ (𝑣 = 𝑃 → (𝑣 ∈ 𝑥 ↔ 𝑃 ∈ 𝑥))
8	7	anbi1d 469	. . . . . . . 8 ⊢ (𝑣 = 𝑃 → ((𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦) ↔ (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦)))
9	8	rexbidv 2551	. . . . . . 7 ⊢ (𝑣 = 𝑃 → (∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦)))
10	6, 9	imbi12d 234	. . . . . 6 ⊢ (𝑣 = 𝑃 → (((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦)) ↔ ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))))
11	10	ralbidv 2550	. . . . 5 ⊢ (𝑣 = 𝑃 → (∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦)) ↔ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))))
12	11	rabbidv 2810	. . . 4 ⊢ (𝑣 = 𝑃 → {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))} = {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})
13		simpr 110	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → 𝑃 ∈ 𝑋)
14		fnmap 6929	. . . . . 6 ⊢ ↑𝑚 Fn (V × V)
15		toponmax 15126	. . . . . . . 8 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝐾)
16	15	elexd 2835	. . . . . . 7 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ V)
17	16	ad2antlr 493	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → 𝑌 ∈ V)
18		toponmax 15126	. . . . . . . 8 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
19	18	elexd 2835	. . . . . . 7 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ V)
20	19	ad2antrr 492	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → 𝑋 ∈ V)
21		fnovex 6118	. . . . . 6 ⊢ (( ↑𝑚 Fn (V × V) ∧ 𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝑌 ↑𝑚 𝑋) ∈ V)
22	14, 17, 20, 21	mp3an2i 1383	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → (𝑌 ↑𝑚 𝑋) ∈ V)
23		rabexg 4279	. . . . 5 ⊢ ((𝑌 ↑𝑚 𝑋) ∈ V → {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))} ∈ V)
24	22, 23	syl 14	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))} ∈ V)
25	4, 12, 13, 24	fvmptd3 5799	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → ((𝑣 ∈ 𝑋 ↦ {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑣) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑣 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})‘𝑃) = {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})
26	3, 25	eqtrd 2271	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝑃 ∈ 𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})
27	26	3impa 1225	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → ((𝐽 CnP 𝐾)‘𝑃) = {𝑓 ∈ (𝑌 ↑𝑚 𝑋) ∣ ∀𝑦 ∈ 𝐾 ((𝑓‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑓 “ 𝑥) ⊆ 𝑦))})

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  {crab 2532  Vcvv 2821   ⊆ wss 3220   ↦ cmpt 4192   × cxp 4772   “ cima 4777   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085   ↑_𝑚 cmap 6922  TopOnctopon 15111   CnP ccnp 15287

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-top 15099  df-topon 15112  df-cnp 15290

This theorem is used by:  iscnp  15300