Theorem mtestbdd 26320

Description: Given the hypotheses of the Weierstrass M-test, the convergent function of the sequence is uniformly bounded. (Contributed by Mario Carneiro, 9-Jul-2017.)

Hypotheses

Ref	Expression
mtest.z	⊢ 𝑍 = (ℤ≥‘𝑁)
mtest.n	⊢ (𝜑 → 𝑁 ∈ ℤ)
mtest.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
mtest.f	⊢ (𝜑 → 𝐹:𝑍⟶(ℂ ↑m 𝑆))
mtest.m	⊢ (𝜑 → 𝑀 ∈ 𝑊)
mtest.c	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝑀‘𝑘) ∈ ℝ)
mtest.l	⊢ ((𝜑 ∧ (𝑘 ∈ 𝑍 ∧ 𝑧 ∈ 𝑆)) → (abs‘((𝐹‘𝑘)‘𝑧)) ≤ (𝑀‘𝑘))
mtest.d	⊢ (𝜑 → seq𝑁( + , 𝑀) ∈ dom ⇝ )
mtest.t	⊢ (𝜑 → seq𝑁( ∘f + , 𝐹)(⇝𝑢‘𝑆)𝑇)

Assertion

Ref	Expression
mtestbdd	⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 (abs‘(𝑇‘𝑧)) ≤ 𝑥)

Distinct variable groups:   𝑥,𝑘,𝑧,𝐹   𝑘,𝑀,𝑥,𝑧   𝑘,𝑁,𝑥,𝑧   𝜑,𝑘,𝑥,𝑧   𝑥,𝑇,𝑧   𝑘,𝑍,𝑥,𝑧   𝑆,𝑘,𝑥,𝑧

Allowed substitution hints:   𝑇(𝑘)   𝑉(𝑥,𝑧,𝑘)   𝑊(𝑥,𝑧,𝑘)

Proof of Theorem mtestbdd

Dummy variables 𝑗 𝑛 𝑚 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mtest.n	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ)
2		mtest.d	. . 3 ⊢ (𝜑 → seq𝑁( + , 𝑀) ∈ dom ⇝ )
3		mtest.z	. . . . . 6 ⊢ 𝑍 = (ℤ≥‘𝑁)
4		mtest.c	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝑀‘𝑘) ∈ ℝ)
5	4	recnd 11208	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝑀‘𝑘) ∈ ℂ)
6	3, 1, 5	serf 14001	. . . . 5 ⊢ (𝜑 → seq𝑁( + , 𝑀):𝑍⟶ℂ)
7	6	ffvelcdmda 7058	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (seq𝑁( + , 𝑀)‘𝑚) ∈ ℂ)
8	7	ralrimiva 3126	. . 3 ⊢ (𝜑 → ∀𝑚 ∈ 𝑍 (seq𝑁( + , 𝑀)‘𝑚) ∈ ℂ)
9	3	climbdd 15644	. . 3 ⊢ ((𝑁 ∈ ℤ ∧ seq𝑁( + , 𝑀) ∈ dom ⇝ ∧ ∀𝑚 ∈ 𝑍 (seq𝑁( + , 𝑀)‘𝑚) ∈ ℂ) → ∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)
10	1, 2, 8, 9	syl3anc 1373	. 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)
11	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) → 𝑁 ∈ ℤ)
12		seqfn 13984	. . . . . . 7 ⊢ (𝑁 ∈ ℤ → seq𝑁( ∘f + , 𝐹) Fn (ℤ≥‘𝑁))
13	1, 12	syl 17	. . . . . 6 ⊢ (𝜑 → seq𝑁( ∘f + , 𝐹) Fn (ℤ≥‘𝑁))
14	3	fneq2i 6618	. . . . . 6 ⊢ (seq𝑁( ∘f + , 𝐹) Fn 𝑍 ↔ seq𝑁( ∘f + , 𝐹) Fn (ℤ≥‘𝑁))
15	13, 14	sylibr 234	. . . . 5 ⊢ (𝜑 → seq𝑁( ∘f + , 𝐹) Fn 𝑍)
16		mtest.t	. . . . 5 ⊢ (𝜑 → seq𝑁( ∘f + , 𝐹)(⇝𝑢‘𝑆)𝑇)
17		ulmf2 26299	. . . . 5 ⊢ ((seq𝑁( ∘f + , 𝐹) Fn 𝑍 ∧ seq𝑁( ∘f + , 𝐹)(⇝𝑢‘𝑆)𝑇) → seq𝑁( ∘f + , 𝐹):𝑍⟶(ℂ ↑m 𝑆))
18	15, 16, 17	syl2anc 584	. . . 4 ⊢ (𝜑 → seq𝑁( ∘f + , 𝐹):𝑍⟶(ℂ ↑m 𝑆))
19	18	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) → seq𝑁( ∘f + , 𝐹):𝑍⟶(ℂ ↑m 𝑆))
20		simplrl 776	. . . 4 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ)
21		fveq2 6860	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → ((𝐹‘𝑗)‘𝑥) = ((𝐹‘𝑗)‘𝑧))
22	21	mpteq2dv 5203	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)))
23	22	seqeq3d 13980	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥))) = seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧))))
24	23	fveq1d 6862	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛) = (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)))‘𝑛))
25		eqid 2730	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝑆 ↦ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛)) = (𝑥 ∈ 𝑆 ↦ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛))
26		fvex 6873	. . . . . . . . . 10 ⊢ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)))‘𝑛) ∈ V
27	24, 25, 26	fvmpt 6970	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑆 → ((𝑥 ∈ 𝑆 ↦ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛))‘𝑧) = (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)))‘𝑛))
28	27	adantl 481	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → ((𝑥 ∈ 𝑆 ↦ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛))‘𝑧) = (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)))‘𝑛))
29		mtest.f	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:𝑍⟶(ℂ ↑m 𝑆))
30	29	ad3antrrr 730	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → 𝐹:𝑍⟶(ℂ ↑m 𝑆))
31	30	feqmptd 6931	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → 𝐹 = (𝑗 ∈ 𝑍 ↦ (𝐹‘𝑗)))
32	30	ffvelcdmda 7058	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ (ℂ ↑m 𝑆))
33		elmapi 8824	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹‘𝑗) ∈ (ℂ ↑m 𝑆) → (𝐹‘𝑗):𝑆⟶ℂ)
34	32, 33	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗):𝑆⟶ℂ)
35	34	feqmptd 6931	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑗)‘𝑥)))
36	35	mpteq2dva 5202	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (𝑗 ∈ 𝑍 ↦ (𝐹‘𝑗)) = (𝑗 ∈ 𝑍 ↦ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑗)‘𝑥))))
37	31, 36	eqtrd 2765	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → 𝐹 = (𝑗 ∈ 𝑍 ↦ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑗)‘𝑥))))
38	37	seqeq3d 13980	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → seq𝑁( ∘f + , 𝐹) = seq𝑁( ∘f + , (𝑗 ∈ 𝑍 ↦ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑗)‘𝑥)))))
39	38	fveq1d 6862	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (seq𝑁( ∘f + , 𝐹)‘𝑛) = (seq𝑁( ∘f + , (𝑗 ∈ 𝑍 ↦ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑗)‘𝑥))))‘𝑛))
40		mtest.s	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
41	40	ad3antrrr 730	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → 𝑆 ∈ 𝑉)
42		simplr 768	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → 𝑛 ∈ 𝑍)
43	42, 3	eleqtrdi 2839	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → 𝑛 ∈ (ℤ≥‘𝑁))
44		elfzuz 13487	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (𝑁...𝑛) → 𝑘 ∈ (ℤ≥‘𝑁))
45	44, 3	eleqtrrdi 2840	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (𝑁...𝑛) → 𝑘 ∈ 𝑍)
46	45	ssriv 3952	. . . . . . . . . . . 12 ⊢ (𝑁...𝑛) ⊆ 𝑍
47	46	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (𝑁...𝑛) ⊆ 𝑍)
48	34	ffvelcdmda 7058	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑗 ∈ 𝑍) ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝑗)‘𝑥) ∈ ℂ)
49	48	anasss 466	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ (𝑗 ∈ 𝑍 ∧ 𝑥 ∈ 𝑆)) → ((𝐹‘𝑗)‘𝑥) ∈ ℂ)
50	41, 43, 47, 49	seqof2 14031	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (seq𝑁( ∘f + , (𝑗 ∈ 𝑍 ↦ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑗)‘𝑥))))‘𝑛) = (𝑥 ∈ 𝑆 ↦ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛)))
51	39, 50	eqtrd 2765	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (seq𝑁( ∘f + , 𝐹)‘𝑛) = (𝑥 ∈ 𝑆 ↦ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛)))
52	51	fveq1d 6862	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → ((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧) = ((𝑥 ∈ 𝑆 ↦ (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑥)))‘𝑛))‘𝑧))
53	45	adantl 481	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → 𝑘 ∈ 𝑍)
54		fveq2 6860	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘))
55	54	fveq1d 6862	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑘 → ((𝐹‘𝑗)‘𝑧) = ((𝐹‘𝑘)‘𝑧))
56		eqid 2730	. . . . . . . . . . 11 ⊢ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧))
57		fvex 6873	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑘)‘𝑧) ∈ V
58	55, 56, 57	fvmpt 6970	. . . . . . . . . 10 ⊢ (𝑘 ∈ 𝑍 → ((𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧))‘𝑘) = ((𝐹‘𝑘)‘𝑧))
59	53, 58	syl 17	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → ((𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧))‘𝑘) = ((𝐹‘𝑘)‘𝑧))
60		simplr 768	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑗 ∈ 𝑍) → 𝑧 ∈ 𝑆)
61	34, 60	ffvelcdmd 7059	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑗 ∈ 𝑍) → ((𝐹‘𝑗)‘𝑧) ∈ ℂ)
62	61	fmpttd 7089	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)):𝑍⟶ℂ)
63	62	ffvelcdmda 7058	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ 𝑍) → ((𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧))‘𝑘) ∈ ℂ)
64	45, 63	sylan2 593	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → ((𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧))‘𝑘) ∈ ℂ)
65	59, 64	eqeltrrd 2830	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → ((𝐹‘𝑘)‘𝑧) ∈ ℂ)
66	59, 43, 65	fsumser 15702	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)((𝐹‘𝑘)‘𝑧) = (seq𝑁( + , (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑧)))‘𝑛))
67	28, 52, 66	3eqtr4d 2775	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → ((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧) = Σ𝑘 ∈ (𝑁...𝑛)((𝐹‘𝑘)‘𝑧))
68	67	fveq2d 6864	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧)) = (abs‘Σ𝑘 ∈ (𝑁...𝑛)((𝐹‘𝑘)‘𝑧)))
69		fzfid 13944	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (𝑁...𝑛) ∈ Fin)
70	69, 65	fsumcl 15705	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)((𝐹‘𝑘)‘𝑧) ∈ ℂ)
71	70	abscld 15411	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘Σ𝑘 ∈ (𝑁...𝑛)((𝐹‘𝑘)‘𝑧)) ∈ ℝ)
72	65	abscld 15411	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → (abs‘((𝐹‘𝑘)‘𝑧)) ∈ ℝ)
73	69, 72	fsumrecl 15706	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(abs‘((𝐹‘𝑘)‘𝑧)) ∈ ℝ)
74	20	adantr 480	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → 𝑦 ∈ ℝ)
75	69, 65	fsumabs 15773	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘Σ𝑘 ∈ (𝑁...𝑛)((𝐹‘𝑘)‘𝑧)) ≤ Σ𝑘 ∈ (𝑁...𝑛)(abs‘((𝐹‘𝑘)‘𝑧)))
76		simp-4l 782	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → 𝜑)
77	76, 53, 4	syl2anc 584	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → (𝑀‘𝑘) ∈ ℝ)
78	69, 77	fsumrecl 15706	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘) ∈ ℝ)
79		simplr 768	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → 𝑧 ∈ 𝑆)
80		mtest.l	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑍 ∧ 𝑧 ∈ 𝑆)) → (abs‘((𝐹‘𝑘)‘𝑧)) ≤ (𝑀‘𝑘))
81	76, 53, 79, 80	syl12anc 836	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → (abs‘((𝐹‘𝑘)‘𝑧)) ≤ (𝑀‘𝑘))
82	69, 72, 77, 81	fsumle 15771	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(abs‘((𝐹‘𝑘)‘𝑧)) ≤ Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘))
83	78	recnd 11208	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘) ∈ ℂ)
84	83	abscld 15411	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘)) ∈ ℝ)
85	78	leabsd 15387	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘) ≤ (abs‘Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘)))
86		eqidd 2731	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → (𝑀‘𝑘) = (𝑀‘𝑘))
87	76, 53, 5	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) ∧ 𝑘 ∈ (𝑁...𝑛)) → (𝑀‘𝑘) ∈ ℂ)
88	86, 43, 87	fsumser 15702	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘) = (seq𝑁( + , 𝑀)‘𝑛))
89	88	fveq2d 6864	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘)) = (abs‘(seq𝑁( + , 𝑀)‘𝑛)))
90		simprr 772	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) → ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)
91		fveq2 6860	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑛 → (seq𝑁( + , 𝑀)‘𝑚) = (seq𝑁( + , 𝑀)‘𝑛))
92	91	fveq2d 6864	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (abs‘(seq𝑁( + , 𝑀)‘𝑚)) = (abs‘(seq𝑁( + , 𝑀)‘𝑛)))
93	92	breq1d 5119	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦 ↔ (abs‘(seq𝑁( + , 𝑀)‘𝑛)) ≤ 𝑦))
94	93	rspccva 3590	. . . . . . . . . . . 12 ⊢ ((∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑁( + , 𝑀)‘𝑛)) ≤ 𝑦)
95	90, 94	sylan 580	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑁( + , 𝑀)‘𝑛)) ≤ 𝑦)
96	95	adantr 480	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘(seq𝑁( + , 𝑀)‘𝑛)) ≤ 𝑦)
97	89, 96	eqbrtrd 5131	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘)) ≤ 𝑦)
98	78, 84, 74, 85, 97	letrd 11337	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(𝑀‘𝑘) ≤ 𝑦)
99	73, 78, 74, 82, 98	letrd 11337	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → Σ𝑘 ∈ (𝑁...𝑛)(abs‘((𝐹‘𝑘)‘𝑧)) ≤ 𝑦)
100	71, 73, 74, 75, 99	letrd 11337	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘Σ𝑘 ∈ (𝑁...𝑛)((𝐹‘𝑘)‘𝑧)) ≤ 𝑦)
101	68, 100	eqbrtrd 5131	. . . . 5 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝑆) → (abs‘((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧)) ≤ 𝑦)
102	101	ralrimiva 3126	. . . 4 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) → ∀𝑧 ∈ 𝑆 (abs‘((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧)) ≤ 𝑦)
103		brralrspcev 5169	. . . 4 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑧 ∈ 𝑆 (abs‘((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧)) ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 (abs‘((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧)) ≤ 𝑥)
104	20, 102, 103	syl2anc 584	. . 3 ⊢ (((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) ∧ 𝑛 ∈ 𝑍) → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 (abs‘((seq𝑁( ∘f + , 𝐹)‘𝑛)‘𝑧)) ≤ 𝑥)
105	16	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) → seq𝑁( ∘f + , 𝐹)(⇝𝑢‘𝑆)𝑇)
106	3, 11, 19, 104, 105	ulmbdd 26313	. 2 ⊢ ((𝜑 ∧ (𝑦 ∈ ℝ ∧ ∀𝑚 ∈ 𝑍 (abs‘(seq𝑁( + , 𝑀)‘𝑚)) ≤ 𝑦)) → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 (abs‘(𝑇‘𝑧)) ≤ 𝑥)
107	10, 106	rexlimddv 3141	1 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 (abs‘(𝑇‘𝑧)) ≤ 𝑥)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3045  ∃wrex 3054   ⊆ wss 3916   class class class wbr 5109   ↦ cmpt 5190  dom cdm 5640   Fn wfn 6508  ⟶wf 6509  ‘cfv 6513  (class class class)co 7389   ∘_f cof 7653   ↑_m cmap 8801  ℂcc 11072  ℝcr 11073   + caddc 11077   ≤ cle 11215  ℤcz 12535  ℤ_≥cuz 12799  ...cfz 13474  seqcseq 13972  abscabs 15206   ⇝ cli 15456  Σcsu 15658  ⇝_𝑢culm 26291

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713  ax-inf2 9600  ax-cnex 11130  ax-resscn 11131  ax-1cn 11132  ax-icn 11133  ax-addcl 11134  ax-addrcl 11135  ax-mulcl 11136  ax-mulrcl 11137  ax-mulcom 11138  ax-addass 11139  ax-mulass 11140  ax-distr 11141  ax-i2m1 11142  ax-1ne0 11143  ax-1rid 11144  ax-rnegex 11145  ax-rrecex 11146  ax-cnre 11147  ax-pre-lttri 11148  ax-pre-lttrn 11149  ax-pre-ltadd 11150  ax-pre-mulgt0 11151  ax-pre-sup 11152

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-pss 3936  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4913  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-se 5594  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6276  df-ord 6337  df-on 6338  df-lim 6339  df-suc 6340  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-isom 6522  df-riota 7346  df-ov 7392  df-oprab 7393  df-mpo 7394  df-of 7655  df-om 7845  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8380  df-1o 8436  df-er 8673  df-map 8803  df-pm 8804  df-en 8921  df-dom 8922  df-sdom 8923  df-fin 8924  df-sup 9399  df-oi 9469  df-card 9898  df-pnf 11216  df-mnf 11217  df-xr 11218  df-ltxr 11219  df-le 11220  df-sub 11413  df-neg 11414  df-div 11842  df-nn 12188  df-2 12250  df-3 12251  df-n0 12449  df-z 12536  df-uz 12800  df-rp 12958  df-ico 13318  df-fz 13475  df-fzo 13622  df-seq 13973  df-exp 14033  df-hash 14302  df-cj 15071  df-re 15072  df-im 15073  df-sqrt 15207  df-abs 15208  df-clim 15460  df-sum 15659  df-ulm 26292

This theorem is referenced by:  lgamgulmlem6  26950