Theorem ulmval 26737

Description: Express the predicate: The sequence of functions 𝐹 converges uniformly to 𝐺 on 𝑆. (Contributed by Mario Carneiro, 26-Feb-2015.)

Assertion

Ref	Expression
ulmval	⊢ (𝑆 ∈ 𝑉 → (𝐹(⇝𝑢‘𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))

Distinct variable groups:   𝑗,𝑘,𝑛,𝑥,𝑧,𝐹   𝑗,𝐺,𝑘,𝑛,𝑥,𝑧   𝑆,𝑗,𝑘,𝑛,𝑥,𝑧   𝑛,𝑉

Allowed substitution hints:   𝑉(𝑥, 𝑧, 𝑗, 𝑘)

Proof of Theorem ulmval

Dummy variables 𝑓 𝑦 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ulmrel 26735	. . . 4 ⊢ Rel (⇝𝑢‘𝑆)
2	1	brrelex12i 5710	. . 3 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
3	2	a1i 11	. 2 ⊢ (𝑆 ∈ 𝑉 → (𝐹(⇝𝑢‘𝑆)𝐺 → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
4		3simpa 1166	. . . 4 ⊢ ((𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥) → (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ))
5		fvex 6921	. . . . . . 7 ⊢ (ℤ≥‘𝑛) ∈ V
6		fex 7255	. . . . . . 7 ⊢ ((𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ (ℤ≥‘𝑛) ∈ V) → 𝐹 ∈ V)
7	5, 6	mpan2 704	. . . . . 6 ⊢ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) → 𝐹 ∈ V)
8	7	a1i 11	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) → 𝐹 ∈ V))
9		fex 7255	. . . . . 6 ⊢ ((𝐺:𝑆⟶ℂ ∧ 𝑆 ∈ 𝑉) → 𝐺 ∈ V)
10	9	expcom 419	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝐺:𝑆⟶ℂ → 𝐺 ∈ V))
11	8, 10	anim12d 621	. . . 4 ⊢ (𝑆 ∈ 𝑉 → ((𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ) → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
12	4, 11	syl5 35	. . 3 ⊢ (𝑆 ∈ 𝑉 → ((𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥) → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
13	12	rexlimdvw 3172	. 2 ⊢ (𝑆 ∈ 𝑉 → (∃𝑛 ∈ ℤ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥) → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
14		df-ulm 26734	. . . . . 6 ⊢ ⇝𝑢 = (𝑠 ∈ V ↦ {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)})
15		oveq2 7451	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (ℂ ↑m 𝑠) = (ℂ ↑m 𝑆))
16	15	feq3d 6716	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑠) ↔ 𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)))
17		feq2 6710	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (𝑦:𝑠⟶ℂ ↔ 𝑦:𝑆⟶ℂ))
18		raleq 3320	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥))
19	18	rexralbidv 3232	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥))
20	19	ralbidv 3189	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥))
21	16, 17, 20	3anbi123d 1465	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → ((𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)))
22	21	rexbidv 3190	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)))
23	22	opabbidv 5174	. . . . . 6 ⊢ (𝑠 = 𝑆 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} = {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)})
24		elex 3475	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
25		simpr1 1213	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆))
26		uzssz 13013	. . . . . . . . . . . . 13 ⊢ (ℤ≥‘𝑛) ⊆ ℤ
27		ovex 7476	. . . . . . . . . . . . . 14 ⊢ (ℂ ↑m 𝑆) ∈ V
28		zex 12729	. . . . . . . . . . . . . 14 ⊢ ℤ ∈ V
29		elpm2r 8893	. . . . . . . . . . . . . 14 ⊢ ((((ℂ ↑m 𝑆) ∈ V ∧ ℤ ∈ V) ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ (ℤ≥‘𝑛) ⊆ ℤ)) → 𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ))
30	27, 28, 29	mpanl12 715	. . . . . . . . . . . . 13 ⊢ ((𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ (ℤ≥‘𝑛) ⊆ ℤ) → 𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ))
31	25, 26, 30	sylancl 598	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ))
32		simpr2 1214	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑦:𝑆⟶ℂ)
33		cnex 11308	. . . . . . . . . . . . . 14 ⊢ ℂ ∈ V
34		simpl 488	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑆 ∈ 𝑉)
35		elmapg 8887	. . . . . . . . . . . . . 14 ⊢ ((ℂ ∈ V ∧ 𝑆 ∈ 𝑉) → (𝑦 ∈ (ℂ ↑m 𝑆) ↔ 𝑦:𝑆⟶ℂ))
36	33, 34, 35	sylancr 599	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → (𝑦 ∈ (ℂ ↑m 𝑆) ↔ 𝑦:𝑆⟶ℂ))
37	32, 36	mpbird 260	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑦 ∈ (ℂ ↑m 𝑆))
38	31, 37	jca 521	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → (𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ) ∧ 𝑦 ∈ (ℂ ↑m 𝑆)))
39	38	ex 418	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝑉 → ((𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) → (𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ) ∧ 𝑦 ∈ (ℂ ↑m 𝑆))))
40	39	rexlimdvw 3172	. . . . . . . . 9 ⊢ (𝑆 ∈ 𝑉 → (∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) → (𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ) ∧ 𝑦 ∈ (ℂ ↑m 𝑆))))
41	40	ssopab2dv 5530	. . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ⊆ {⟨𝑓, 𝑦⟩ ∣ (𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ) ∧ 𝑦 ∈ (ℂ ↑m 𝑆))})
42		df-xp 5661	. . . . . . . 8 ⊢ (((ℂ ↑m 𝑆) ↑pm ℤ) × (ℂ ↑m 𝑆)) = {⟨𝑓, 𝑦⟩ ∣ (𝑓 ∈ ((ℂ ↑m 𝑆) ↑pm ℤ) ∧ 𝑦 ∈ (ℂ ↑m 𝑆))}
43	41, 42	sseqtrrdi 3954	. . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ⊆ (((ℂ ↑m 𝑆) ↑pm ℤ) × (ℂ ↑m 𝑆)))
44		ovex 7476	. . . . . . . . 9 ⊢ ((ℂ ↑m 𝑆) ↑pm ℤ) ∈ V
45	44, 27	xpex 7791	. . . . . . . 8 ⊢ (((ℂ ↑m 𝑆) ↑pm ℤ) × (ℂ ↑m 𝑆)) ∈ V
46	45	ssex 5286	. . . . . . 7 ⊢ ({⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ⊆ (((ℂ ↑m 𝑆) ↑pm ℤ) × (ℂ ↑m 𝑆)) → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ∈ V)
47	43, 46	syl 18	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ∈ V)
48	14, 23, 24, 47	fvmptd3 7040	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (⇝𝑢‘𝑆) = {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)})
49	48	breqd 5117	. . . 4 ⊢ (𝑆 ∈ 𝑉 → (𝐹(⇝𝑢‘𝑆)𝐺 ↔ 𝐹{⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)}𝐺))
50		simpl 488	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → 𝑓 = 𝐹)
51	50	feq1d 6713	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ↔ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)))
52		simpr 490	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → 𝑦 = 𝐺)
53	52	feq1d 6713	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑦:𝑆⟶ℂ ↔ 𝐺:𝑆⟶ℂ))
54	50	fveq1d 6910	. . . . . . . . . . . . . 14 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑓‘𝑘) = (𝐹‘𝑘))
55	54	fveq1d 6910	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑓‘𝑘)‘𝑧) = ((𝐹‘𝑘)‘𝑧))
56	52	fveq1d 6910	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑦‘𝑧) = (𝐺‘𝑧))
57	55, 56	oveq12d 7461	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧)) = (((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧)))
58	57	fveq2d 6912	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) = (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))))
59	58	breq1d 5116	. . . . . . . . . 10 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → ((abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
60	59	ralbidv 3189	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
61	60	rexralbidv 3232	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
62	61	ralbidv 3189	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
63	51, 53, 62	3anbi123d 1465	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
64	63	rexbidv 3190	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
65		eqid 2763	. . . . 5 ⊢ {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} = {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)}
66	64, 65	brabga 5512	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹{⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)}𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
67	49, 66	sylan9bb 519	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝐹 ∈ V ∧ 𝐺 ∈ V)) → (𝐹(⇝𝑢‘𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
68	67	ex 418	. 2 ⊢ (𝑆 ∈ 𝑉 → ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹(⇝𝑢‘𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))))
69	3, 13, 68	pm5.21ndd 382	1 ⊢ (𝑆 ∈ 𝑉 → (𝐹(⇝𝑢‘𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ (ℤ≥‘𝑛)∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   class class class wbr 5106  {copab 5170   × cxp 5653  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443   ↑_m cmap 8875   ↑_pm cpm 8876  ℂcc 11225   < clt 11370   − cmin 11568  ℤcz 12720  ℤ_≥cuz 12992  ℝ⁺crp 13147  abscabs 15430  ⇝_𝑢culm 26733

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-map 8877  df-pm 8878  df-neg 11571  df-z 12721  df-uz 12993  df-ulm 26734

This theorem is used by:  ulmcl  26738  ulmf  26739  ulm2  26742