ulmval - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ulmval		Structured version Visualization version GIF version

Theorem ulmval 25892

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 25890	. . . 4 ⊢ Rel (⇝_𝑢‘𝑆)
2	1	brrelex12i 5732	. . 3 ⊢ (𝐹(⇝_𝑢‘𝑆)𝐺 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
3	2	a1i 11	. 2 ⊢ (𝑆 ∈ 𝑉 → (𝐹(⇝_𝑢‘𝑆)𝐺 → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
4		3simpa 1149	. . . 4 ⊢ ((𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥) → (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ))
5		fvex 6905	. . . . . . 7 ⊢ (ℤ_≥‘𝑛) ∈ V
6		fex 7228	. . . . . . 7 ⊢ ((𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ (ℤ_≥‘𝑛) ∈ V) → 𝐹 ∈ V)
7	5, 6	mpan2 690	. . . . . 6 ⊢ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) → 𝐹 ∈ V)
8	7	a1i 11	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) → 𝐹 ∈ V))
9		fex 7228	. . . . . 6 ⊢ ((𝐺:𝑆⟶ℂ ∧ 𝑆 ∈ 𝑉) → 𝐺 ∈ V)
10	9	expcom 415	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝐺:𝑆⟶ℂ → 𝐺 ∈ V))
11	8, 10	anim12d 610	. . . 4 ⊢ (𝑆 ∈ 𝑉 → ((𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ) → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
12	4, 11	syl5 34	. . 3 ⊢ (𝑆 ∈ 𝑉 → ((𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥) → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
13	12	rexlimdvw 3161	. 2 ⊢ (𝑆 ∈ 𝑉 → (∃𝑛 ∈ ℤ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥) → (𝐹 ∈ V ∧ 𝐺 ∈ V)))
14		df-ulm 25889	. . . . . 6 ⊢ ⇝_𝑢 = (𝑠 ∈ V ↦ {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)})
15		oveq2 7417	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (ℂ ↑_m 𝑠) = (ℂ ↑_m 𝑆))
16	15	feq3d 6705	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑠) ↔ 𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆)))
17		feq2 6700	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (𝑦:𝑠⟶ℂ ↔ 𝑦:𝑆⟶ℂ))
18		raleq 3323	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥))
19	18	rexralbidv 3221	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥))
20	19	ralbidv 3178	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥))
21	16, 17, 20	3anbi123d 1437	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → ((𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)))
22	21	rexbidv 3179	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)))
23	22	opabbidv 5215	. . . . . 6 ⊢ (𝑠 = 𝑆 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑠 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} = {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)})
24		elex 3493	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
25		simpr1 1195	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆))
26		uzssz 12843	. . . . . . . . . . . . 13 ⊢ (ℤ_≥‘𝑛) ⊆ ℤ
27		ovex 7442	. . . . . . . . . . . . . 14 ⊢ (ℂ ↑_m 𝑆) ∈ V
28		zex 12567	. . . . . . . . . . . . . 14 ⊢ ℤ ∈ V
29		elpm2r 8839	. . . . . . . . . . . . . 14 ⊢ ((((ℂ ↑_m 𝑆) ∈ V ∧ ℤ ∈ V) ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ (ℤ_≥‘𝑛) ⊆ ℤ)) → 𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ))
30	27, 28, 29	mpanl12 701	. . . . . . . . . . . . 13 ⊢ ((𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ (ℤ_≥‘𝑛) ⊆ ℤ) → 𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ))
31	25, 26, 30	sylancl 587	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ))
32		simpr2 1196	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑦:𝑆⟶ℂ)
33		cnex 11191	. . . . . . . . . . . . . 14 ⊢ ℂ ∈ V
34		simpl 484	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑆 ∈ 𝑉)
35		elmapg 8833	. . . . . . . . . . . . . 14 ⊢ ((ℂ ∈ V ∧ 𝑆 ∈ 𝑉) → (𝑦 ∈ (ℂ ↑_m 𝑆) ↔ 𝑦:𝑆⟶ℂ))
36	33, 34, 35	sylancr 588	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → (𝑦 ∈ (ℂ ↑_m 𝑆) ↔ 𝑦:𝑆⟶ℂ))
37	32, 36	mpbird 257	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → 𝑦 ∈ (ℂ ↑_m 𝑆))
38	31, 37	jca 513	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)) → (𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ) ∧ 𝑦 ∈ (ℂ ↑_m 𝑆)))
39	38	ex 414	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝑉 → ((𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) → (𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ) ∧ 𝑦 ∈ (ℂ ↑_m 𝑆))))
40	39	rexlimdvw 3161	. . . . . . . . 9 ⊢ (𝑆 ∈ 𝑉 → (∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) → (𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ) ∧ 𝑦 ∈ (ℂ ↑_m 𝑆))))
41	40	ssopab2dv 5552	. . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ⊆ {⟨𝑓, 𝑦⟩ ∣ (𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ) ∧ 𝑦 ∈ (ℂ ↑_m 𝑆))})
42		df-xp 5683	. . . . . . . 8 ⊢ (((ℂ ↑_m 𝑆) ↑_pm ℤ) × (ℂ ↑_m 𝑆)) = {⟨𝑓, 𝑦⟩ ∣ (𝑓 ∈ ((ℂ ↑_m 𝑆) ↑_pm ℤ) ∧ 𝑦 ∈ (ℂ ↑_m 𝑆))}
43	41, 42	sseqtrrdi 4034	. . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ⊆ (((ℂ ↑_m 𝑆) ↑_pm ℤ) × (ℂ ↑_m 𝑆)))
44		ovex 7442	. . . . . . . . 9 ⊢ ((ℂ ↑_m 𝑆) ↑_pm ℤ) ∈ V
45	44, 27	xpex 7740	. . . . . . . 8 ⊢ (((ℂ ↑_m 𝑆) ↑_pm ℤ) × (ℂ ↑_m 𝑆)) ∈ V
46	45	ssex 5322	. . . . . . 7 ⊢ ({⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ⊆ (((ℂ ↑_m 𝑆) ↑_pm ℤ) × (ℂ ↑_m 𝑆)) → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ∈ V)
47	43, 46	syl 17	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} ∈ V)
48	14, 23, 24, 47	fvmptd3 7022	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (⇝_𝑢‘𝑆) = {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)})
49	48	breqd 5160	. . . 4 ⊢ (𝑆 ∈ 𝑉 → (𝐹(⇝_𝑢‘𝑆)𝐺 ↔ 𝐹{⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)}𝐺))
50		simpl 484	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → 𝑓 = 𝐹)
51	50	feq1d 6703	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ↔ 𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆)))
52		simpr 486	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → 𝑦 = 𝐺)
53	52	feq1d 6703	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑦:𝑆⟶ℂ ↔ 𝐺:𝑆⟶ℂ))
54	50	fveq1d 6894	. . . . . . . . . . . . . 14 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑓‘𝑘) = (𝐹‘𝑘))
55	54	fveq1d 6894	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑓‘𝑘)‘𝑧) = ((𝐹‘𝑘)‘𝑧))
56	52	fveq1d 6894	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (𝑦‘𝑧) = (𝐺‘𝑧))
57	55, 56	oveq12d 7427	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧)) = (((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧)))
58	57	fveq2d 6896	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) = (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))))
59	58	breq1d 5159	. . . . . . . . . 10 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → ((abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
60	59	ralbidv 3178	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
61	60	rexralbidv 3221	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
62	61	ralbidv 3178	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))
63	51, 53, 62	3anbi123d 1437	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
64	63	rexbidv 3179	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐺) → (∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥) ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
65		eqid 2733	. . . . 5 ⊢ {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)} = {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)}
66	64, 65	brabga 5535	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹{⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝑦:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝑓‘𝑘)‘𝑧) − (𝑦‘𝑧))) < 𝑥)}𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
67	49, 66	sylan9bb 511	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝐹 ∈ V ∧ 𝐺 ∈ V)) → (𝐹(⇝_𝑢‘𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))
68	67	ex 414	. 2 ⊢ (𝑆 ∈ 𝑉 → ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹(⇝_𝑢‘𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥))))
69	3, 13, 68	pm5.21ndd 381	1 ⊢ (𝑆 ∈ 𝑉 → (𝐹(⇝_𝑢‘𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ_≥‘𝑛)⟶(ℂ ↑_m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ (ℤ_≥‘𝑛)∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(((𝐹‘𝑘)‘𝑧) − (𝐺‘𝑧))) < 𝑥)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ⊆ wss 3949 class class class wbr 5149 {copab 5211 × cxp 5675 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ↑_m cmap 8820 ↑_pm cpm 8821 ℂcc 11108 < clt 11248 − cmin 11444 ℤcz 12558 ℤ_≥cuz 12822 ℝ⁺crp 12974 abscabs 15181 ⇝_𝑢culm 25888

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-map 8822 df-pm 8823 df-neg 11447 df-z 12559 df-uz 12823 df-ulm 25889

This theorem is referenced by: ulmcl 25893 ulmf 25894 ulm2 25897

W3C validator