knoppndvlem6 - Mathbox for Asger C. Ipsen

	Mathbox for Asger C. Ipsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > knoppndvlem6		Structured version Visualization version GIF version

Theorem knoppndvlem6 36518

Description: Lemma for knoppndv 36535. (Contributed by Asger C. Ipsen, 15-Jun-2021.) (Revised by Asger C. Ipsen, 5-Jul-2021.)

**Hypotheses**
Ref	Expression
knoppndvlem6.t	⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥)))
knoppndvlem6.f	⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ₀ ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)))))
knoppndvlem6.w	⊢ 𝑊 = (𝑤 ∈ ℝ ↦ Σ𝑖 ∈ ℕ₀ ((𝐹‘𝑤)‘𝑖))
knoppndvlem6.a	⊢ 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)
knoppndvlem6.c	⊢ (𝜑 → 𝐶 ∈ (-1(,)1))
knoppndvlem6.j	⊢ (𝜑 → 𝐽 ∈ ℕ₀)
knoppndvlem6.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
knoppndvlem6.n	⊢ (𝜑 → 𝑁 ∈ ℕ)

**Assertion**
Ref	Expression
knoppndvlem6	⊢ (𝜑 → (𝑊‘𝐴) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))

Distinct variable groups: 𝐴,𝑖,𝑛,𝑤,𝑦 𝑥,𝐴,𝑖,𝑤 𝐶,𝑛,𝑦 𝑖,𝐹,𝑤 𝑖,𝐽,𝑛,𝑦 𝑛,𝑁,𝑦 𝑥,𝑁 𝑇,𝑛,𝑦 𝜑,𝑖,𝑛,𝑤,𝑦 Allowed substitution hints: 𝜑(𝑥) 𝐶(𝑥,𝑤,𝑖) 𝑇(𝑥,𝑤,𝑖) 𝐹(𝑥,𝑦,𝑛) 𝐽(𝑥,𝑤) 𝑀(𝑥,𝑦,𝑤,𝑖,𝑛) 𝑁(𝑤,𝑖) 𝑊(𝑥,𝑦,𝑤,𝑖,𝑛)

**Proof of Theorem knoppndvlem6**
Step	Hyp	Ref	Expression
1		knoppndvlem6.w	. . . 4 ⊢ 𝑊 = (𝑤 ∈ ℝ ↦ Σ𝑖 ∈ ℕ₀ ((𝐹‘𝑤)‘𝑖))
2		fveq2 6906	. . . . . 6 ⊢ (𝑤 = 𝐴 → (𝐹‘𝑤) = (𝐹‘𝐴))
3	2	fveq1d 6908	. . . . 5 ⊢ (𝑤 = 𝐴 → ((𝐹‘𝑤)‘𝑖) = ((𝐹‘𝐴)‘𝑖))
4	3	sumeq2sdv 15739	. . . 4 ⊢ (𝑤 = 𝐴 → Σ𝑖 ∈ ℕ₀ ((𝐹‘𝑤)‘𝑖) = Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖))
5		knoppndvlem6.a	. . . . . 6 ⊢ 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)
6	5	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀))
7		knoppndvlem6.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8		knoppndvlem6.j	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℕ₀)
9	8	nn0zd 12639	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ ℤ)
10		knoppndvlem6.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
11	7, 9, 10	knoppndvlem1 36513	. . . . 5 ⊢ (𝜑 → ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀) ∈ ℝ)
12	6, 11	eqeltrd 2841	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
13		sumex 15724	. . . . 5 ⊢ Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) ∈ V
14	13	a1i 11	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) ∈ V)
15	1, 4, 12, 14	fvmptd3 7039	. . 3 ⊢ (𝜑 → (𝑊‘𝐴) = Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖))
16		nn0uz 12920	. . . 4 ⊢ ℕ₀ = (ℤ_≥‘0)
17		eqid 2737	. . . 4 ⊢ (ℤ_≥‘(𝐽 + 1)) = (ℤ_≥‘(𝐽 + 1))
18		peano2nn0 12566	. . . . 5 ⊢ (𝐽 ∈ ℕ₀ → (𝐽 + 1) ∈ ℕ₀)
19	8, 18	syl 17	. . . 4 ⊢ (𝜑 → (𝐽 + 1) ∈ ℕ₀)
20		eqidd 2738	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝐹‘𝐴)‘𝑖) = ((𝐹‘𝐴)‘𝑖))
21		knoppndvlem6.t	. . . . . 6 ⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥)))
22		knoppndvlem6.f	. . . . . 6 ⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ₀ ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)))))
23	7	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝑁 ∈ ℕ)
24		knoppndvlem6.c	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ (-1(,)1))
25	24	knoppndvlem3 36515	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1))
26	25	simpld 494	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℝ)
27	26	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝐶 ∈ ℝ)
28	12	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝐴 ∈ ℝ)
29		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → 𝑖 ∈ ℕ₀)
30	21, 22, 23, 27, 28, 29	knoppcnlem3 36496	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝐹‘𝐴)‘𝑖) ∈ ℝ)
31	30	recnd 11289	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝐹‘𝐴)‘𝑖) ∈ ℂ)
32	21, 22, 1, 12, 24, 7	knoppndvlem4 36516	. . . . 5 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴))
33		seqex 14044	. . . . . 6 ⊢ seq0( + , (𝐹‘𝐴)) ∈ V
34		fvex 6919	. . . . . 6 ⊢ (𝑊‘𝐴) ∈ V
35	33, 34	breldm 5919	. . . . 5 ⊢ (seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴) → seq0( + , (𝐹‘𝐴)) ∈ dom ⇝ )
36	32, 35	syl 17	. . . 4 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ∈ dom ⇝ )
37	16, 17, 19, 20, 31, 36	isumsplit 15876	. . 3 ⊢ (𝜑 → Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) = (Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
38	8	nn0cnd 12589	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℂ)
39		1cnd 11256	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
40	38, 39	pncand 11621	. . . . . 6 ⊢ (𝜑 → ((𝐽 + 1) − 1) = 𝐽)
41	40	oveq2d 7447	. . . . 5 ⊢ (𝜑 → (0...((𝐽 + 1) − 1)) = (0...𝐽))
42	41	sumeq1d 15736	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
43	42	oveq1d 7446	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
44	15, 37, 43	3eqtrd 2781	. 2 ⊢ (𝜑 → (𝑊‘𝐴) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
45	12	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐴 ∈ ℝ)
46		eluznn0 12959	. . . . . . . . 9 ⊢ (((𝐽 + 1) ∈ ℕ₀ ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℕ₀)
47	19, 46	sylan 580	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℕ₀)
48	22, 45, 47	knoppcnlem1 36494	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐹‘𝐴)‘𝑖) = ((𝐶↑𝑖) · (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴))))
49	5	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀))
50	49	oveq2d 7447	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · 𝐴) = (((2 · 𝑁)↑𝑖) · ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)))
51	7	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑁 ∈ ℕ)
52	47	nn0zd 12639	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℤ)
53	9	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐽 ∈ ℤ)
54	10	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑀 ∈ ℤ)
55		eluzle 12891	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (ℤ_≥‘(𝐽 + 1)) → (𝐽 + 1) ≤ 𝑖)
56	55	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 + 1) ≤ 𝑖)
57	53, 52	jca 511	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 ∈ ℤ ∧ 𝑖 ∈ ℤ))
58		zltp1le 12667	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ ℤ ∧ 𝑖 ∈ ℤ) → (𝐽 < 𝑖 ↔ (𝐽 + 1) ≤ 𝑖))
59	57, 58	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 < 𝑖 ↔ (𝐽 + 1) ≤ 𝑖))
60	56, 59	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐽 < 𝑖)
61	51, 52, 53, 54, 60	knoppndvlem2 36514	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)) ∈ ℤ)
62	50, 61	eqeltrd 2841	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · 𝐴) ∈ ℤ)
63	21, 62	dnizeq0 36476	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴)) = 0)
64	63	oveq2d 7447	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐶↑𝑖) · (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴))) = ((𝐶↑𝑖) · 0))
65	26	recnd 11289	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℂ)
66	65	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐶 ∈ ℂ)
67	66, 47	expcld 14186	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐶↑𝑖) ∈ ℂ)
68	67	mul01d 11460	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐶↑𝑖) · 0) = 0)
69	48, 64, 68	3eqtrd 2781	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐹‘𝐴)‘𝑖) = 0)
70	69	sumeq2dv 15738	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖) = Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0)
71		ssidd 4007	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)))
72	71	orcd 874	. . . . . 6 ⊢ (𝜑 → ((ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)) ∨ (ℤ_≥‘(𝐽 + 1)) ∈ Fin))
73		sumz 15758	. . . . . 6 ⊢ (((ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)) ∨ (ℤ_≥‘(𝐽 + 1)) ∈ Fin) → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0 = 0)
74	72, 73	syl 17	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0 = 0)
75	70, 74	eqtrd 2777	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖) = 0)
76	75	oveq2d 7447	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + 0))
77	21, 22, 12, 26, 7	knoppndvlem5 36517	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) ∈ ℝ)
78	77	recnd 11289	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) ∈ ℂ)
79	78	addridd 11461	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + 0) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
80	76, 79	eqtrd 2777	. 2 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
81	44, 80	eqtrd 2777	1 ⊢ (𝜑 → (𝑊‘𝐴) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1540 ∈ wcel 2108 Vcvv 3480 ⊆ wss 3951 class class class wbr 5143 ↦ cmpt 5225 dom cdm 5685 ‘cfv 6561 (class class class)co 7431 Fincfn 8985 ℂcc 11153 ℝcr 11154 0cc0 11155 1c1 11156 + caddc 11158 · cmul 11160 < clt 11295 ≤ cle 11296 − cmin 11492 -cneg 11493 / cdiv 11920 ℕcn 12266 2c2 12321 ℕ₀cn0 12526 ℤcz 12613 ℤ_≥cuz 12878 (,)cioo 13387 ...cfz 13547 ⌊cfl 13830 seqcseq 14042 ↑cexp 14102 abscabs 15273 ⇝ cli 15520 Σcsu 15722

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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-inf2 9681 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 ax-pre-sup 11233

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-se 5638 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-map 8868 df-pm 8869 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-sup 9482 df-inf 9483 df-oi 9550 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-div 11921 df-nn 12267 df-2 12329 df-3 12330 df-n0 12527 df-z 12614 df-uz 12879 df-rp 13035 df-ioo 13391 df-ico 13393 df-fz 13548 df-fzo 13695 df-fl 13832 df-seq 14043 df-exp 14103 df-hash 14370 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-limsup 15507 df-clim 15524 df-rlim 15525 df-sum 15723 df-ulm 26420

This theorem is referenced by: knoppndvlem15 36527

W3C validator