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 36500

Description: Lemma for knoppndv 36517. (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 6907	. . . . . 6 ⊢ (𝑤 = 𝐴 → (𝐹‘𝑤) = (𝐹‘𝐴))
3	2	fveq1d 6909	. . . . 5 ⊢ (𝑤 = 𝐴 → ((𝐹‘𝑤)‘𝑖) = ((𝐹‘𝐴)‘𝑖))
4	3	sumeq2sdv 15736	. . . 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 12637	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ ℤ)
10		knoppndvlem6.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
11	7, 9, 10	knoppndvlem1 36495	. . . . 5 ⊢ (𝜑 → ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀) ∈ ℝ)
12	6, 11	eqeltrd 2839	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
13		sumex 15721	. . . . 5 ⊢ Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) ∈ V
14	13	a1i 11	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) ∈ V)
15	1, 4, 12, 14	fvmptd3 7039	. . 3 ⊢ (𝜑 → (𝑊‘𝐴) = Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖))
16		nn0uz 12918	. . . 4 ⊢ ℕ₀ = (ℤ_≥‘0)
17		eqid 2735	. . . 4 ⊢ (ℤ_≥‘(𝐽 + 1)) = (ℤ_≥‘(𝐽 + 1))
18		peano2nn0 12564	. . . . 5 ⊢ (𝐽 ∈ ℕ₀ → (𝐽 + 1) ∈ ℕ₀)
19	8, 18	syl 17	. . . 4 ⊢ (𝜑 → (𝐽 + 1) ∈ ℕ₀)
20		eqidd 2736	. . . 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 36497	. . . . . . . 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 36478	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝐹‘𝐴)‘𝑖) ∈ ℝ)
31	30	recnd 11287	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ₀) → ((𝐹‘𝐴)‘𝑖) ∈ ℂ)
32	21, 22, 1, 12, 24, 7	knoppndvlem4 36498	. . . . 5 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴))
33		seqex 14041	. . . . . 6 ⊢ seq0( + , (𝐹‘𝐴)) ∈ V
34		fvex 6920	. . . . . 6 ⊢ (𝑊‘𝐴) ∈ V
35	33, 34	breldm 5922	. . . . 5 ⊢ (seq0( + , (𝐹‘𝐴)) ⇝ (𝑊‘𝐴) → seq0( + , (𝐹‘𝐴)) ∈ dom ⇝ )
36	32, 35	syl 17	. . . 4 ⊢ (𝜑 → seq0( + , (𝐹‘𝐴)) ∈ dom ⇝ )
37	16, 17, 19, 20, 31, 36	isumsplit 15873	. . 3 ⊢ (𝜑 → Σ𝑖 ∈ ℕ₀ ((𝐹‘𝐴)‘𝑖) = (Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
38	8	nn0cnd 12587	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℂ)
39		1cnd 11254	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
40	38, 39	pncand 11619	. . . . . 6 ⊢ (𝜑 → ((𝐽 + 1) − 1) = 𝐽)
41	40	oveq2d 7447	. . . . 5 ⊢ (𝜑 → (0...((𝐽 + 1) − 1)) = (0...𝐽))
42	41	sumeq1d 15733	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
43	42	oveq1d 7446	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...((𝐽 + 1) − 1))((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
44	15, 37, 43	3eqtrd 2779	. 2 ⊢ (𝜑 → (𝑊‘𝐴) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)))
45	12	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐴 ∈ ℝ)
46		eluznn0 12957	. . . . . . . . 9 ⊢ (((𝐽 + 1) ∈ ℕ₀ ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℕ₀)
47	19, 46	sylan 580	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℕ₀)
48	22, 45, 47	knoppcnlem1 36476	. . . . . . 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 12637	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑖 ∈ ℤ)
53	9	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐽 ∈ ℤ)
54	10	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝑀 ∈ ℤ)
55		eluzle 12889	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (ℤ_≥‘(𝐽 + 1)) → (𝐽 + 1) ≤ 𝑖)
56	55	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 + 1) ≤ 𝑖)
57	53, 52	jca 511	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 ∈ ℤ ∧ 𝑖 ∈ ℤ))
58		zltp1le 12665	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ ℤ ∧ 𝑖 ∈ ℤ) → (𝐽 < 𝑖 ↔ (𝐽 + 1) ≤ 𝑖))
59	57, 58	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐽 < 𝑖 ↔ (𝐽 + 1) ≤ 𝑖))
60	56, 59	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐽 < 𝑖)
61	51, 52, 53, 54, 60	knoppndvlem2 36496	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)) ∈ ℤ)
62	50, 61	eqeltrd 2839	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (((2 · 𝑁)↑𝑖) · 𝐴) ∈ ℤ)
63	21, 62	dnizeq0 36458	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴)) = 0)
64	63	oveq2d 7447	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐶↑𝑖) · (𝑇‘(((2 · 𝑁)↑𝑖) · 𝐴))) = ((𝐶↑𝑖) · 0))
65	26	recnd 11287	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℂ)
66	65	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → 𝐶 ∈ ℂ)
67	66, 47	expcld 14183	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → (𝐶↑𝑖) ∈ ℂ)
68	67	mul01d 11458	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐶↑𝑖) · 0) = 0)
69	48, 64, 68	3eqtrd 2779	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ_≥‘(𝐽 + 1))) → ((𝐹‘𝐴)‘𝑖) = 0)
70	69	sumeq2dv 15735	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖) = Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0)
71		ssidd 4019	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)))
72	71	orcd 873	. . . . . 6 ⊢ (𝜑 → ((ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)) ∨ (ℤ_≥‘(𝐽 + 1)) ∈ Fin))
73		sumz 15755	. . . . . 6 ⊢ (((ℤ_≥‘(𝐽 + 1)) ⊆ (ℤ_≥‘(𝐽 + 1)) ∨ (ℤ_≥‘(𝐽 + 1)) ∈ Fin) → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0 = 0)
74	72, 73	syl 17	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))0 = 0)
75	70, 74	eqtrd 2775	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖) = 0)
76	75	oveq2d 7447	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + 0))
77	21, 22, 12, 26, 7	knoppndvlem5 36499	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) ∈ ℝ)
78	77	recnd 11287	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) ∈ ℂ)
79	78	addridd 11459	. . 3 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + 0) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
80	76, 79	eqtrd 2775	. 2 ⊢ (𝜑 → (Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖) + Σ𝑖 ∈ (ℤ_≥‘(𝐽 + 1))((𝐹‘𝐴)‘𝑖)) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))
81	44, 80	eqtrd 2775	1 ⊢ (𝜑 → (𝑊‘𝐴) = Σ𝑖 ∈ (0...𝐽)((𝐹‘𝐴)‘𝑖))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ⊆ wss 3963 class class class wbr 5148 ↦ cmpt 5231 dom cdm 5689 ‘cfv 6563 (class class class)co 7431 Fincfn 8984 ℂcc 11151 ℝcr 11152 0cc0 11153 1c1 11154 + caddc 11156 · cmul 11158 < clt 11293 ≤ cle 11294 − cmin 11490 -cneg 11491 / cdiv 11918 ℕcn 12264 2c2 12319 ℕ₀cn0 12524 ℤcz 12611 ℤ_≥cuz 12876 (,)cioo 13384 ...cfz 13544 ⌊cfl 13827 seqcseq 14039 ↑cexp 14099 abscabs 15270 ⇝ cli 15517 Σcsu 15719

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-inf2 9679 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-map 8867 df-pm 8868 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9480 df-inf 9481 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-z 12612 df-uz 12877 df-rp 13033 df-ioo 13388 df-ico 13390 df-fz 13545 df-fzo 13692 df-fl 13829 df-seq 14040 df-exp 14100 df-hash 14367 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-limsup 15504 df-clim 15521 df-rlim 15522 df-sum 15720 df-ulm 26435

This theorem is referenced by: knoppndvlem15 36509

W3C validator