Theorem cncfval 14892

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 8020	. . 3 ⊢ ℂ ∈ V
2	1	elpw2 4191	. 2 ⊢ (𝐴 ∈ 𝒫 ℂ ↔ 𝐴 ⊆ ℂ)
3	1	elpw2 4191	. 2 ⊢ (𝐵 ∈ 𝒫 ℂ ↔ 𝐵 ⊆ ℂ)
4		mapvalg 6726	. . . . . 6 ⊢ ((𝐵 ∈ 𝒫 ℂ ∧ 𝐴 ∈ 𝒫 ℂ) → (𝐵 ↑𝑚 𝐴) = {𝑓 ∣ 𝑓:𝐴⟶𝐵})
5	4	ancoms 268	. . . . 5 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐵 ↑𝑚 𝐴) = {𝑓 ∣ 𝑓:𝐴⟶𝐵})
6		mapex 6722	. . . . 5 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V)
7	5, 6	eqeltrd 2273	. . . 4 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐵 ↑𝑚 𝐴) ∈ V)
8		rabexg 4177	. . . 4 ⊢ ((𝐵 ↑𝑚 𝐴) ∈ V → {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} ∈ V)
9	7, 8	syl 14	. . 3 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} ∈ V)
10		oveq2 5933	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑏 ↑𝑚 𝑎) = (𝑏 ↑𝑚 𝐴))
11		raleq 2693	. . . . . . . 8 ⊢ (𝑎 = 𝐴 → (∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
12	11	rexbidv 2498	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
13	12	ralbidv 2497	. . . . . 6 ⊢ (𝑎 = 𝐴 → (∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
14	13	raleqbi1dv 2705	. . . . 5 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
15	10, 14	rabeqbidv 2758	. . . 4 ⊢ (𝑎 = 𝐴 → {𝑓 ∈ (𝑏 ↑𝑚 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} = {𝑓 ∈ (𝑏 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
16		oveq1 5932	. . . . 5 ⊢ (𝑏 = 𝐵 → (𝑏 ↑𝑚 𝐴) = (𝐵 ↑𝑚 𝐴))
17	16	rabeqdv 2757	. . . 4 ⊢ (𝑏 = 𝐵 → {𝑓 ∈ (𝑏 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
18		df-cncf 14891	. . . 4 ⊢ –cn→ = (𝑎 ∈ 𝒫 ℂ, 𝑏 ∈ 𝒫 ℂ ↦ {𝑓 ∈ (𝑏 ↑𝑚 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
19	15, 17, 18	ovmpog 6061	. . 3 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ ∧ {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)} ∈ V) → (𝐴–cn→𝐵) = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
20	9, 19	mpd3an3 1349	. 2 ⊢ ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐴–cn→𝐵) = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})
21	2, 3, 20	syl2anbr 292	1 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴–cn→𝐵) = {𝑓 ∈ (𝐵 ↑𝑚 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)})

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2167  {cab 2182  ∀wral 2475  ∃wrex 2476  {crab 2479  Vcvv 2763   ⊆ wss 3157  𝒫 cpw 3606   class class class wbr 4034  ⟶wf 5255  ‘cfv 5259  (class class class)co 5925   ↑_𝑚 cmap 6716  ℂcc 7894   < clt 8078   − cmin 8214  ℝ⁺crp 9745  abscabs 11179  –cn→ccncf 14890

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-map 6718  df-cncf 14891

This theorem is referenced by:  elcncf  14893