fourierdlem86 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > fourierdlem86		Structured version Visualization version GIF version

Theorem fourierdlem86 40409

Description: Continuity of 𝑂 and its limits with respect to the 𝑆 partition. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem86.f	⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
fourierdlem86.xre	⊢ (𝜑 → 𝑋 ∈ ℝ)
fourierdlem86.p	⊢ 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_𝑚 (0...𝑚)) ∣ (((𝑝‘0) = (-π + 𝑋) ∧ (𝑝‘𝑚) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
fourierdlem86.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
fourierdlem86.v	⊢ (𝜑 → 𝑉 ∈ (𝑃‘𝑀))
fourierdlem86.fcn	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) ∈ (((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))–cn→ℂ))
fourierdlem86.r	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘𝑖)))
fourierdlem86.l	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘(𝑖 + 1))))
fourierdlem86.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem86.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem86.altb	⊢ (𝜑 → 𝐴 < 𝐵)
fourierdlem86.ab	⊢ (𝜑 → (𝐴[,]𝐵) ⊆ (-π[,]π))
fourierdlem86.n0	⊢ (𝜑 → ¬ 0 ∈ (𝐴[,]𝐵))
fourierdlem86.c	⊢ (𝜑 → 𝐶 ∈ ℝ)
fourierdlem86.o	⊢ 𝑂 = (𝑠 ∈ (𝐴[,]𝐵) ↦ ((((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠) · (𝑠 / (2 · (sin‘(𝑠 / 2))))))
fourierdlem86.q	⊢ 𝑄 = (𝑖 ∈ (0...𝑀) ↦ ((𝑉‘𝑖) − 𝑋))
fourierdlem86.t	⊢ 𝑇 = ({𝐴, 𝐵} ∪ (ran 𝑄 ∩ (𝐴(,)𝐵)))
fourierdlem86.n	⊢ 𝑁 = ((#‘𝑇) − 1)
fourierdlem86.s	⊢ 𝑆 = (℩𝑓𝑓 Isom < , < ((0...𝑁), 𝑇))
fourierdlem86.d	⊢ 𝐷 = (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2)))))
fourierdlem86.e	⊢ 𝐸 = (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2)))))
fourierdlem86.u	⊢ 𝑈 = (℩𝑖 ∈ (0..^𝑀)((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))

**Assertion**
Ref	Expression
fourierdlem86	⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → ((𝐷 ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ 𝐸 ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)))

Distinct variable groups: 𝐴,𝑠 𝐵,𝑠 𝐶,𝑖,𝑠 𝑖,𝐹,𝑠 𝐿,𝑠 𝑖,𝑀,𝑚,𝑝 𝑗,𝑀,𝑠,𝑖 𝑓,𝑁 𝑖,𝑁,𝑠 𝑖,𝑂 𝑄,𝑖,𝑠 𝑅,𝑠 𝑆,𝑓 𝑆,𝑖,𝑠 𝑇,𝑓 𝑈,𝑖 𝑖,𝑉,𝑝 𝑗,𝑉,𝑠 𝑖,𝑋,𝑚,𝑝 𝑗,𝑋,𝑠 𝑓,𝑗,𝜑 𝜑,𝑖,𝑠 Allowed substitution hints: 𝜑(𝑚,𝑝) 𝐴(𝑓,𝑖,𝑗,𝑚,𝑝) 𝐵(𝑓,𝑖,𝑗,𝑚,𝑝) 𝐶(𝑓,𝑗,𝑚,𝑝) 𝐷(𝑓,𝑖,𝑗,𝑚,𝑠,𝑝) 𝑃(𝑓,𝑖,𝑗,𝑚,𝑠,𝑝) 𝑄(𝑓,𝑗,𝑚,𝑝) 𝑅(𝑓,𝑖,𝑗,𝑚,𝑝) 𝑆(𝑗,𝑚,𝑝) 𝑇(𝑖,𝑗,𝑚,𝑠,𝑝) 𝑈(𝑓,𝑗,𝑚,𝑠,𝑝) 𝐸(𝑓,𝑖,𝑗,𝑚,𝑠,𝑝) 𝐹(𝑓,𝑗,𝑚,𝑝) 𝐿(𝑓,𝑖,𝑗,𝑚,𝑝) 𝑀(𝑓) 𝑁(𝑗,𝑚,𝑝) 𝑂(𝑓,𝑗,𝑚,𝑠,𝑝) 𝑉(𝑓,𝑚) 𝑋(𝑓)

Proof of Theorem fourierdlem86 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fourierdlem86.d	. . 3 ⊢ 𝐷 = (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2)))))
2		fourierdlem86.xre	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ℝ)
3	2	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝑋 ∈ ℝ)
4		fourierdlem86.p	. . . . . . . 8 ⊢ 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_𝑚 (0...𝑚)) ∣ (((𝑝‘0) = (-π + 𝑋) ∧ (𝑝‘𝑚) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
5		fourierdlem86.m	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℕ)
6	5	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝑀 ∈ ℕ)
7		fourierdlem86.v	. . . . . . . . 9 ⊢ (𝜑 → 𝑉 ∈ (𝑃‘𝑀))
8	7	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝑉 ∈ (𝑃‘𝑀))
9		fourierdlem86.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ)
10	9	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝐴 ∈ ℝ)
11		fourierdlem86.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ)
12	11	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝐵 ∈ ℝ)
13		fourierdlem86.altb	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 < 𝐵)
14	13	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝐴 < 𝐵)
15		fourierdlem86.ab	. . . . . . . . 9 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ (-π[,]π))
16	15	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (𝐴[,]𝐵) ⊆ (-π[,]π))
17		fourierdlem86.q	. . . . . . . 8 ⊢ 𝑄 = (𝑖 ∈ (0...𝑀) ↦ ((𝑉‘𝑖) − 𝑋))
18		fourierdlem86.t	. . . . . . . 8 ⊢ 𝑇 = ({𝐴, 𝐵} ∪ (ran 𝑄 ∩ (𝐴(,)𝐵)))
19		fourierdlem86.n	. . . . . . . 8 ⊢ 𝑁 = ((#‘𝑇) − 1)
20		fourierdlem86.s	. . . . . . . 8 ⊢ 𝑆 = (℩𝑓𝑓 Isom < , < ((0...𝑁), 𝑇))
21		simpr 477	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝑗 ∈ (0..^𝑁))
22		fourierdlem86.u	. . . . . . . 8 ⊢ 𝑈 = (℩𝑖 ∈ (0..^𝑀)((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
23		biid 251	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ 𝑦 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑦)(,)(𝑄‘(𝑦 + 1)))) ↔ (((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∧ 𝑦 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑦)(,)(𝑄‘(𝑦 + 1)))))
24	3, 4, 6, 8, 10, 12, 14, 16, 17, 18, 19, 20, 21, 22, 23	fourierdlem50 40373	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (𝑈 ∈ (0..^𝑀) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1)))))
25	24	simpld 475	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝑈 ∈ (0..^𝑀))
26		id 22	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (𝜑 ∧ 𝑗 ∈ (0..^𝑁)))
27	24	simprd 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1))))
28	26, 25, 27	jca31 557	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑈 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1)))))
29		nfv 1843	. . . . . . . 8 ⊢ Ⅎ𝑖(((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑈 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1))))
30		nfv 1843	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑖(𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1))
31		nfcsb1v 3549	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑖⦋𝑈 / 𝑖⦌𝐿
32		nfcv 2764	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑖(𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))
33	30, 31, 32	nfif 4115	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1)))))
34		nfcv 2764	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖 −
35		nfcv 2764	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖𝐶
36	33, 34, 35	nfov 6676	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶)
37		nfcv 2764	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖 /
38		nfcv 2764	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝑆‘(𝑗 + 1))
39	36, 37, 38	nfov 6676	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1)))
40		nfcv 2764	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖 ·
41		nfcv 2764	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))
42	39, 40, 41	nfov 6676	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2)))))
43	42	nfel1 2779	. . . . . . . . . 10 ⊢ Ⅎ𝑖(((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1)))
44		nfv 1843	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑖(𝑆‘𝑗) = (𝑄‘𝑈)
45		nfcsb1v 3549	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑖⦋𝑈 / 𝑖⦌𝑅
46		nfcv 2764	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑖(𝐹‘(𝑋 + (𝑆‘𝑗)))
47	44, 45, 46	nfif 4115	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗))))
48	47, 34, 35	nfov 6676	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶)
49		nfcv 2764	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝑆‘𝑗)
50	48, 37, 49	nfov 6676	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗))
51		nfcv 2764	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))
52	50, 40, 51	nfov 6676	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2)))))
53	52	nfel1 2779	. . . . . . . . . 10 ⊢ Ⅎ𝑖(((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))
54	43, 53	nfan 1828	. . . . . . . . 9 ⊢ Ⅎ𝑖((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗)))
55		nfv 1843	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)
56	54, 55	nfan 1828	. . . . . . . 8 ⊢ Ⅎ𝑖(((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ))
57	29, 56	nfim 1825	. . . . . . 7 ⊢ Ⅎ𝑖((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑈 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1)))) → (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)))
58		eleq1 2689	. . . . . . . . . 10 ⊢ (𝑖 = 𝑈 → (𝑖 ∈ (0..^𝑀) ↔ 𝑈 ∈ (0..^𝑀)))
59	58	anbi2d 740	. . . . . . . . 9 ⊢ (𝑖 = 𝑈 → (((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ↔ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑈 ∈ (0..^𝑀))))
60		fveq2 6191	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑈 → (𝑄‘𝑖) = (𝑄‘𝑈))
61		oveq1 6657	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑈 → (𝑖 + 1) = (𝑈 + 1))
62	61	fveq2d 6195	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑈 → (𝑄‘(𝑖 + 1)) = (𝑄‘(𝑈 + 1)))
63	60, 62	oveq12d 6668	. . . . . . . . . 10 ⊢ (𝑖 = 𝑈 → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) = ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1))))
64	63	sseq2d 3633	. . . . . . . . 9 ⊢ (𝑖 = 𝑈 → (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↔ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1)))))
65	59, 64	anbi12d 747	. . . . . . . 8 ⊢ (𝑖 = 𝑈 → ((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ↔ (((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑈 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1))))))
66	62	eqeq2d 2632	. . . . . . . . . . . . . . 15 ⊢ (𝑖 = 𝑈 → ((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)) ↔ (𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1))))
67		csbeq1a 3542	. . . . . . . . . . . . . . 15 ⊢ (𝑖 = 𝑈 → 𝐿 = ⦋𝑈 / 𝑖⦌𝐿)
68	66, 67	ifbieq1d 4109	. . . . . . . . . . . . . 14 ⊢ (𝑖 = 𝑈 → if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) = if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))))
69	68	oveq1d 6665	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑈 → (if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) = (if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶))
70	69	oveq1d 6665	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑈 → ((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) = ((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))))
71	70	oveq1d 6665	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑈 → (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) = (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))))
72	71	eleq1d 2686	. . . . . . . . . 10 ⊢ (𝑖 = 𝑈 → ((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ↔ (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1)))))
73	60	eqeq2d 2632	. . . . . . . . . . . . . . 15 ⊢ (𝑖 = 𝑈 → ((𝑆‘𝑗) = (𝑄‘𝑖) ↔ (𝑆‘𝑗) = (𝑄‘𝑈)))
74		csbeq1a 3542	. . . . . . . . . . . . . . 15 ⊢ (𝑖 = 𝑈 → 𝑅 = ⦋𝑈 / 𝑖⦌𝑅)
75	73, 74	ifbieq1d 4109	. . . . . . . . . . . . . 14 ⊢ (𝑖 = 𝑈 → if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) = if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))))
76	75	oveq1d 6665	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑈 → (if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) = (if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶))
77	76	oveq1d 6665	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑈 → ((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) = ((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)))
78	77	oveq1d 6665	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑈 → (((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) = (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))))
79	78	eleq1d 2686	. . . . . . . . . 10 ⊢ (𝑖 = 𝑈 → ((((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗)) ↔ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))))
80	72, 79	anbi12d 747	. . . . . . . . 9 ⊢ (𝑖 = 𝑈 → (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ↔ ((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗)))))
81	80	anbi1d 741	. . . . . . . 8 ⊢ (𝑖 = 𝑈 → ((((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)) ↔ (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ))))
82	65, 81	imbi12d 334	. . . . . . 7 ⊢ (𝑖 = 𝑈 → (((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ))) ↔ ((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑈 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1)))) → (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)))))
83		fourierdlem86.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
84		fourierdlem86.fcn	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) ∈ (((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))–cn→ℂ))
85		fourierdlem86.r	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘𝑖)))
86		fourierdlem86.l	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘(𝑖 + 1))))
87		fourierdlem86.n0	. . . . . . . 8 ⊢ (𝜑 → ¬ 0 ∈ (𝐴[,]𝐵))
88		fourierdlem86.c	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ)
89		fourierdlem86.o	. . . . . . . 8 ⊢ 𝑂 = (𝑠 ∈ (𝐴[,]𝐵) ↦ ((((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠) · (𝑠 / (2 · (sin‘(𝑠 / 2))))))
90		eqid 2622	. . . . . . . 8 ⊢ (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) = (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2)))))
91		eqid 2622	. . . . . . . 8 ⊢ (((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) = (((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2)))))
92		biid 251	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ↔ (((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))))
93	83, 2, 4, 5, 7, 84, 85, 86, 9, 11, 13, 15, 87, 88, 89, 17, 18, 19, 20, 90, 91, 92	fourierdlem76 40399	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑖 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑖 + 1)), 𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑖), 𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)))
94	57, 82, 93	vtoclg1f 3265	. . . . . 6 ⊢ (𝑈 ∈ (0..^𝑀) → ((((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) ∧ 𝑈 ∈ (0..^𝑀)) ∧ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1))) ⊆ ((𝑄‘𝑈)(,)(𝑄‘(𝑈 + 1)))) → (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ))))
95	25, 28, 94	sylc 65	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)))
96	95	simpld 475	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → ((((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))))
97	96	simpld 475	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (((if((𝑆‘(𝑗 + 1)) = (𝑄‘(𝑈 + 1)), ⦋𝑈 / 𝑖⦌𝐿, (𝐹‘(𝑋 + (𝑆‘(𝑗 + 1))))) − 𝐶) / (𝑆‘(𝑗 + 1))) · ((𝑆‘(𝑗 + 1)) / (2 · (sin‘((𝑆‘(𝑗 + 1)) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))))
98	1, 97	syl5eqel 2705	. 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝐷 ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))))
99		fourierdlem86.e	. . 3 ⊢ 𝐸 = (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2)))))
100	96	simprd 479	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (((if((𝑆‘𝑗) = (𝑄‘𝑈), ⦋𝑈 / 𝑖⦌𝑅, (𝐹‘(𝑋 + (𝑆‘𝑗)))) − 𝐶) / (𝑆‘𝑗)) · ((𝑆‘𝑗) / (2 · (sin‘((𝑆‘𝑗) / 2))))) ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗)))
101	99, 100	syl5eqel 2705	. 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → 𝐸 ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗)))
102	95	simprd 479	. 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ))
103	98, 101, 102	jca31 557	1 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑁)) → ((𝐷 ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘(𝑗 + 1))) ∧ 𝐸 ∈ ((𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) lim_ℂ (𝑆‘𝑗))) ∧ (𝑂 ↾ ((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))) ∈ (((𝑆‘𝑗)(,)(𝑆‘(𝑗 + 1)))–cn→ℂ)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 {crab 2916 ⦋csb 3533 ∪ cun 3572 ∩ cin 3573 ⊆ wss 3574 ifcif 4086 {cpr 4179 class class class wbr 4653 ↦ cmpt 4729 ran crn 5115 ↾ cres 5116 ℩cio 5849 ⟶wf 5884 ‘cfv 5888 Isom wiso 5889 ℩crio 6610 (class class class)co 6650 ↑_𝑚 cmap 7857 ℂcc 9934 ℝcr 9935 0cc0 9936 1c1 9937 + caddc 9939 · cmul 9941 < clt 10074 − cmin 10266 -cneg 10267 / cdiv 10684 ℕcn 11020 2c2 11070 (,)cioo 12175 [,]cicc 12178 ...cfz 12326 ..^cfzo 12465 #chash 13117 sincsin 14794 πcpi 14797 –cn→ccncf 22679 lim_ℂ climc 23626

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 ax-mulf 10016

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-supp 7296 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-2o 7561 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-ixp 7909 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fsupp 8276 df-fi 8317 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-ioo 12179 df-ioc 12180 df-ico 12181 df-icc 12182 df-fz 12327 df-fzo 12466 df-fl 12593 df-mod 12669 df-seq 12802 df-exp 12861 df-fac 13061 df-bc 13090 df-hash 13118 df-shft 13807 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-limsup 14202 df-clim 14219 df-rlim 14220 df-sum 14417 df-ef 14798 df-sin 14800 df-cos 14801 df-pi 14803 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-starv 15956 df-sca 15957 df-vsca 15958 df-ip 15959 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-hom 15966 df-cco 15967 df-rest 16083 df-topn 16084 df-0g 16102 df-gsum 16103 df-topgen 16104 df-pt 16105 df-prds 16108 df-xrs 16162 df-qtop 16167 df-imas 16168 df-xps 16170 df-mre 16246 df-mrc 16247 df-acs 16249 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-mulg 17541 df-cntz 17750 df-cmn 18195 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-fbas 19743 df-fg 19744 df-cnfld 19747 df-top 20699 df-topon 20716 df-topsp 20737 df-bases 20750 df-cld 20823 df-ntr 20824 df-cls 20825 df-nei 20902 df-lp 20940 df-perf 20941 df-cn 21031 df-cnp 21032 df-haus 21119 df-tx 21365 df-hmeo 21558 df-fil 21650 df-fm 21742 df-flim 21743 df-flf 21744 df-xms 22125 df-ms 22126 df-tms 22127 df-cncf 22681 df-limc 23630 df-dv 23631

This theorem is referenced by: fourierdlem103 40426 fourierdlem104 40427

W3C validator