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 35697

Description: Lemma for knoppndv 35714. (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 6892	. . . . . 6 ⊢ (𝑤 = 𝐴 → (𝐹‘𝑤) = (𝐹‘𝐴))
3	2	fveq1d 6894	. . . . 5 ⊢ (𝑤 = 𝐴 → ((𝐹‘𝑤)‘𝑖) = ((𝐹‘𝐴)‘𝑖))
4	3	sumeq2sdv 15655	. . . 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 12589	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ ℤ)
10		knoppndvlem6.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
11	7, 9, 10	knoppndvlem1 35692	. . . . 5 ⊢ (𝜑 → ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀) ∈ ℝ)
12	6, 11	eqeltrd 2832	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
13		sumex 15639	. . . . 5 ⊢ Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) ∈ V
14	13	a1i 11	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) ∈ V)
15	1, 4, 12, 14	fvmptd3 7022	. . 3 ⊢ (𝜑 → (𝑊‘𝐴) = Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖))
16		nn0uz 12869	. . . 4 ⊢ ℕ₀ = (ℤ_≥‘0)
17		eqid 2731	. . . 4 ⊢ (ℤ_≥‘(𝐽 + 1)) = (ℤ_≥‘(𝐽 + 1))
18		peano2nn0 12517	. . . . 5 ⊢ (𝐽 ∈ ℕ₀ → (𝐽 + 1) ∈ ℕ₀)
19	8, 18	syl 17	. . . 4 ⊢ (𝜑 → (𝐽 + 1) ∈ ℕ₀)
20		eqidd 2732	. . . 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 35694	. . . . . . . 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 35675	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝐹‘𝐴)‘𝑖) ∈ ℝ)
31	30	recnd 11247	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝐹‘𝐴)‘𝑖) ∈ ℂ)
32	21, 22, 1, 12, 24, 7	knoppndvlem4 35695	. . . . 5 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴))
33		seqex 13973	. . . . . 6 ⊢ seq0( + , (𝐹‘𝐴)) ∈ V
34		fvex 6905	. . . . . 6 ⊢ (𝑊‘𝐴) ∈ V
35	33, 34	breldm 5909	. . . . 5 ⊢ (seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴) → seq0( + , (𝐹‘𝐴)) ∈ dom ⇝ )
36	32, 35	syl 17	. . . 4 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ∈ dom ⇝ )
37	16, 17, 19, 20, 31, 36	isumsplit 15791	. . 3 ⊢ (𝜑 → Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) = (Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
38	8	nn0cnd 12539	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℂ)
39		1cnd 11214	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
40	38, 39	pncand 11577	. . . . . 6 ⊢ (𝜑 → ((𝐽 + 1) − 1) = 𝐽)
41	40	oveq2d 7428	. . . . 5 ⊢ (𝜑 → (0...((𝐽 + 1) − 1)) = (0...𝐽))
42	41	sumeq1d 15652	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
43	42	oveq1d 7427	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
44	15, 37, 43	3eqtrd 2775	. 2 ⊢ (𝜑 → (𝑊‘𝐴) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
45	12	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐴 ∈ ℝ)
46		eluznn0 12906	. . . . . . . . 9 ⊢ (((𝐽 + 1) ∈ ℕ₀ ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℕ₀)
47	19, 46	sylan 579	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℕ₀)
48	22, 45, 47	knoppcnlem1 35673	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐹‘𝐴)‘𝑖) = ((𝐶↑𝑖) · (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴))))
49	5	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀))
50	49	oveq2d 7428	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · 𝐴) = (((2 · 𝑁)↑𝑖) · ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)))
51	7	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑁 ∈ ℕ)
52	47	nn0zd 12589	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℤ)
53	9	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐽 ∈ ℤ)
54	10	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑀 ∈ ℤ)
55		eluzle 12840	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (ℤ_≥‘(𝐽 + 1)) → (𝐽 + 1) ≤ 𝑖)
56	55	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 + 1) ≤ 𝑖)
57	53, 52	jca 511	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 ∈ ℤ ∧ 𝑖 ∈ ℤ))
58		zltp1le 12617	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ ℤ ∧ 𝑖 ∈ ℤ) → (𝐽 < 𝑖 ↔ (𝐽 + 1) ≤ 𝑖))
59	57, 58	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 < 𝑖 ↔ (𝐽 + 1) ≤ 𝑖))
60	56, 59	mpbird 256	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐽 < 𝑖)
61	51, 52, 53, 54, 60	knoppndvlem2 35693	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)) ∈ ℤ)
62	50, 61	eqeltrd 2832	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · 𝐴) ∈ ℤ)
63	21, 62	dnizeq0 35655	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴)) = 0)
64	63	oveq2d 7428	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐶↑𝑖) · (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴))) = ((𝐶↑𝑖) · 0))
65	26	recnd 11247	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℂ)
66	65	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐶 ∈ ℂ)
67	66, 47	expcld 14116	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐶↑𝑖) ∈ ℂ)
68	67	mul01d 11418	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐶↑𝑖) · 0) = 0)
69	48, 64, 68	3eqtrd 2775	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐹‘𝐴)‘𝑖) = 0)
70	69	sumeq2dv 15654	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖) = Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0)
71		ssidd 4006	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)))
72	71	orcd 870	. . . . . 6 ⊢ (𝜑 → ((ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)) ∨ (ℤ_≥‘(𝐽 + 1)) ∈ Fin))
73		sumz 15673	. . . . . 6 ⊢ (((ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)) ∨ (ℤ_≥‘(𝐽 + 1)) ∈ Fin) → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0 = 0)
74	72, 73	syl 17	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0 = 0)
75	70, 74	eqtrd 2771	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖) = 0)
76	75	oveq2d 7428	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + 0))
77	21, 22, 12, 26, 7	knoppndvlem5 35696	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) ∈ ℝ)
78	77	recnd 11247	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) ∈ ℂ)
79	78	addridd 11419	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + 0) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
80	76, 79	eqtrd 2771	. 2 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
81	44, 80	eqtrd 2771	1 ⊢ (𝜑 → (𝑊‘𝐴) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 844 = wceq 1540 ∈ wcel 2105 Vcvv 3473 ⊆ wss 3949 class class class wbr 5149 ↦ cmpt 5232 dom cdm 5677 ‘cfv 6544 (class class class)co 7412 Fincfn 8942 ℂcc 11111 ℝcr 11112 0cc0 11113 1c1 11114 + caddc 11116 · cmul 11118 < clt 11253 ≤ cle 11254 − cmin 11449 -cneg 11450 / cdiv 11876 ℕcn 12217 2c2 12272 ℕ₀cn0 12477 ℤcz 12563 ℤ_≥cuz 12827 (,)cioo 13329 ...cfz 13489 ⌊cfl 13760 seqcseq 13971 ↑cexp 14032 abscabs 15186 ⇝ cli 15433 Σcsu 15637

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7728 ax-inf2 9639 ax-cnex 11169 ax-resscn 11170 ax-1cn 11171 ax-icn 11172 ax-addcl 11173 ax-addrcl 11174 ax-mulcl 11175 ax-mulrcl 11176 ax-mulcom 11177 ax-addass 11178 ax-mulass 11179 ax-distr 11180 ax-i2m1 11181 ax-1ne0 11182 ax-1rid 11183 ax-rnegex 11184 ax-rrecex 11185 ax-cnre 11186 ax-pre-lttri 11187 ax-pre-lttrn 11188 ax-pre-ltadd 11189 ax-pre-mulgt0 11190 ax-pre-sup 11191

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 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-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 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-isom 6553 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7673 df-om 7859 df-1st 7978 df-2nd 7979 df-frecs 8269 df-wrecs 8300 df-recs 8374 df-rdg 8413 df-1o 8469 df-er 8706 df-map 8825 df-pm 8826 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-sup 9440 df-inf 9441 df-oi 9508 df-card 9937 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11451 df-neg 11452 df-div 11877 df-nn 12218 df-2 12280 df-3 12281 df-n0 12478 df-z 12564 df-uz 12828 df-rp 12980 df-ioo 13333 df-ico 13335 df-fz 13490 df-fzo 13633 df-fl 13762 df-seq 13972 df-exp 14033 df-hash 14296 df-cj 15051 df-re 15052 df-im 15053 df-sqrt 15187 df-abs 15188 df-limsup 15420 df-clim 15437 df-rlim 15438 df-sum 15638 df-ulm 26122

This theorem is referenced by: knoppndvlem15 35706

W3C validator