Theorem cncfval 13199

Description: The value of the continuous complex function operation is the set of continuous functions from 𝐴 to 𝐵. (Contributed by Paul Chapman, 11-Oct-2007.) (Revised by Mario Carneiro, 9-Nov-2013.)

Assertion

Ref	Expression
cncfval	⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴–cn→𝐵) = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})

Distinct variable groups:   𝑤,𝑓,𝑥,𝑦,𝑧,𝐴   𝐵,𝑓,𝑤,𝑥,𝑦,𝑧

Proof of Theorem cncfval

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnex 7877	. . 3 ⊢ ℂ ∈ V
2	1	elpw2 4136	. 2 ⊢ (𝐴 ∈ 𝒫 ℂ ↔ 𝐴 ⊆ ℂ)
3	1	elpw2 4136	. 2 ⊢ (𝐵 ∈ 𝒫 ℂ ↔ 𝐵 ⊆ ℂ)
4		mapvalg 6624	. . . . . 6 ⊢ ((𝐵 ∈ 𝒫 ℂ ∧ 𝐴 ∈ 𝒫 ℂ) → (𝐵 ↑𝑚 𝐴) = {𝑓 ∣ 𝑓:𝐴⟶𝐵})
5	4	ancoms 266	. . . . 5 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐵 ↑𝑚 𝐴) = {𝑓 ∣ 𝑓:𝐴⟶𝐵})
6		mapex 6620	. . . . 5 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V)
7	5, 6	eqeltrd 2243	. . . 4 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐵 ↑𝑚 𝐴) ∈ V)
8		rabexg 4125	. . . 4 ⊢ ((𝐵 ↑𝑚 𝐴) ∈ V → {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} ∈ V)
9	7, 8	syl 14	. . 3 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} ∈ V)
10		oveq2 5850	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑏 ↑𝑚 𝑎) = (𝑏 ↑𝑚 𝐴))
11		raleq 2661	. . . . . . . 8 ⊢ (𝑎 = 𝐴 → (∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
12	11	rexbidv 2467	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
13	12	ralbidv 2466	. . . . . 6 ⊢ (𝑎 = 𝐴 → (∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
14	13	raleqbi1dv 2669	. . . . 5 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
15	10, 14	rabeqbidv 2721	. . . 4 ⊢ (𝑎 = 𝐴 → {𝑓 ∈ (𝑏 ↑𝑚 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} = {𝑓 ∈ (𝑏 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
16		oveq1 5849	. . . . 5 ⊢ (𝑏 = 𝐵 → (𝑏 ↑𝑚 𝐴) = (𝐵 ↑𝑚 𝐴))
17	16	rabeqdv 2720	. . . 4 ⊢ (𝑏 = 𝐵 → {𝑓 ∈ (𝑏 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
18		df-cncf 13198	. . . 4 ⊢ –cn→ = (𝑎 ∈ 𝒫 ℂ, 𝑏 ∈ 𝒫 ℂ ↦ {𝑓 ∈ (𝑏 ↑𝑚 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
19	15, 17, 18	ovmpog 5976	. . 3 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ ∧ {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} ∈ V) → (𝐴–cn→𝐵) = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
20	9, 19	mpd3an3 1328	. 2 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐴–cn→𝐵) = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
21	2, 3, 20	syl2anbr 290	1 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴–cn→𝐵) = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1343   ∈ wcel 2136  {cab 2151  ∀wral 2444  ∃wrex 2445  {crab 2448  Vcvv 2726   ⊆ wss 3116  𝒫 cpw 3559   class class class wbr 3982  ⟶wf 5184  ‘cfv 5188  (class class class)co 5842   ↑_𝑚 cmap 6614  ℂcc 7751   < clt 7933   − cmin 8069  ℝ⁺crp 9589  abscabs 10939  –cn→ccncf 13197

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-map 6616  df-cncf 13198

This theorem is referenced by:  elcncf  13200