fourierdlem40 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem40 46894

Description: 𝐻 is a continuous function on any partition interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem40.f	⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
fourierdlem40.a	⊢ (𝜑 → 𝐴 ∈ (-π[,]π))
fourierdlem40.b	⊢ (𝜑 → 𝐵 ∈ (-π[,]π))
fourierdlem40.x	⊢ (𝜑 → 𝑋 ∈ ℝ)
fourierdlem40.nxelab	⊢ (𝜑 → ¬ 0 ∈ (𝐴(,)𝐵))
fourierdlem40.fcn	⊢ (𝜑 → (𝐹 ↾ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋))) ∈ (((𝐴 + 𝑋)(,)(𝐵 + 𝑋))–cn→ℂ))
fourierdlem40.y	⊢ (𝜑 → 𝑌 ∈ ℝ)
fourierdlem40.w	⊢ (𝜑 → 𝑊 ∈ ℝ)
fourierdlem40.h	⊢ 𝐻 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)))

**Assertion**
Ref	Expression
fourierdlem40	⊢ (𝜑 → (𝐻 ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ))

Distinct variable groups: 𝐴,𝑠 𝐵,𝑠 𝐹,𝑠 𝑊,𝑠 𝑋,𝑠 𝑌,𝑠 𝜑,𝑠 Allowed substitution hint: 𝐻(𝑠)

**Proof of Theorem fourierdlem40**
Step	Hyp	Ref	Expression
1		fourierdlem40.h	. . . . 5 ⊢ 𝐻 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)))
2	1	reseq1i 5976	. . . 4 ⊢ (𝐻 ↾ (𝐴(,)𝐵)) = ((𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠))) ↾ (𝐴(,)𝐵))
3	2	a1i 11	. . 3 ⊢ (𝜑 → (𝐻 ↾ (𝐴(,)𝐵)) = ((𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠))) ↾ (𝐴(,)𝐵)))
4		pire 26650	. . . . . . . . 9 ⊢ π ∈ ℝ
5	4	renegcli 11530	. . . . . . . 8 ⊢ -π ∈ ℝ
6	5	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → -π ∈ ℝ)
7	4	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → π ∈ ℝ)
8		elioore 13414	. . . . . . . 8 ⊢ (𝑠 ∈ (𝐴(,)𝐵) → 𝑠 ∈ ℝ)
9	8	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℝ)
10	5	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → -π ∈ ℝ)
11	4	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → π ∈ ℝ)
12	10, 11	iccssred 13473	. . . . . . . . . . 11 ⊢ (𝜑 → (-π[,]π) ⊆ ℝ)
13		fourierdlem40.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ (-π[,]π))
14	12, 13	sseldd 3939	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
15	14	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ)
16	5, 4	elicc2i 13451	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ (-π[,]π) ↔ (𝐴 ∈ ℝ ∧ -π ≤ 𝐴 ∧ 𝐴 ≤ π))
17	16	simp2bi 1164	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (-π[,]π) → -π ≤ 𝐴)
18	13, 17	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → -π ≤ 𝐴)
19	18	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → -π ≤ 𝐴)
20	15	rexrd 11270	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ^*)
21		fourierdlem40.b	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ (-π[,]π))
22	12, 21	sseldd 3939	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ)
23	22	rexrd 11270	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
24	23	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ^*)
25		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ (𝐴(,)𝐵))
26		ioogtlb 46244	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝑠)
27	20, 24, 25, 26	syl3anc 1398	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝑠)
28	6, 15, 9, 19, 27	lelttrd 11379	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → -π < 𝑠)
29	6, 9, 28	ltled 11369	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → -π ≤ 𝑠)
30	22	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ)
31		iooltub 46259	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 𝐵)
32	20, 24, 25, 31	syl3anc 1398	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 𝐵)
33	5, 4	elicc2i 13451	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (-π[,]π) ↔ (𝐵 ∈ ℝ ∧ -π ≤ 𝐵 ∧ 𝐵 ≤ π))
34	33	simp3bi 1165	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (-π[,]π) → 𝐵 ≤ π)
35	21, 34	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ≤ π)
36	35	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ≤ π)
37	9, 30, 7, 32, 36	ltletrd 11381	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < π)
38	9, 7, 37	ltled 11369	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ≤ π)
39	6, 7, 9, 29, 38	eliccd 46253	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ (-π[,]π))
40	39	ex 418	. . . . 5 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) → 𝑠 ∈ (-π[,]π)))
41	40	ssrdv 3944	. . . 4 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (-π[,]π))
42	41	resmptd 6044	. . 3 ⊢ (𝜑 → ((𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠))) ↾ (𝐴(,)𝐵)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠))))
43		eleq1 2853	. . . . . . . . 9 ⊢ (𝑠 = 0 → (𝑠 ∈ (𝐴(,)𝐵) ↔ 0 ∈ (𝐴(,)𝐵)))
44	43	biimpac 484	. . . . . . . 8 ⊢ ((𝑠 ∈ (𝐴(,)𝐵) ∧ 𝑠 = 0) → 0 ∈ (𝐴(,)𝐵))
45	44	adantll 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) ∧ 𝑠 = 0) → 0 ∈ (𝐴(,)𝐵))
46		fourierdlem40.nxelab	. . . . . . . 8 ⊢ (𝜑 → ¬ 0 ∈ (𝐴(,)𝐵))
47	46	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) ∧ 𝑠 = 0) → ¬ 0 ∈ (𝐴(,)𝐵))
48	45, 47	pm2.65da 829	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ¬ 𝑠 = 0)
49	48	iffalsed 4500	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)) = (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠))
50		fourierdlem40.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
51	50	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐹:ℝ⟶ℝ)
52		fourierdlem40.x	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ℝ)
53	52	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑋 ∈ ℝ)
54	53, 9	readdcld 11249	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) ∈ ℝ)
55	51, 54	ffvelcdmd 7084	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐹‘(𝑋 + 𝑠)) ∈ ℝ)
56		fourierdlem40.y	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ ℝ)
57		fourierdlem40.w	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ ℝ)
58	56, 57	ifcld 4536	. . . . . . . . 9 ⊢ (𝜑 → if(0 < 𝑠, 𝑌, 𝑊) ∈ ℝ)
59	58	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → if(0 < 𝑠, 𝑌, 𝑊) ∈ ℝ)
60	55, 59	resubcld 11653	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) ∈ ℝ)
61	60	recnd 11248	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) ∈ ℂ)
62	9	recnd 11248	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℂ)
63	48	neqned 2967	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ≠ 0)
64	61, 62, 63	divrecd 12005	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠) = (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · (1 / 𝑠)))
65	49, 64	eqtrd 2800	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)) = (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · (1 / 𝑠)))
66	65	mpteq2dva 5206	. . 3 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · (1 / 𝑠))))
67	3, 42, 66	3eqtrd 2804	. 2 ⊢ (𝜑 → (𝐻 ↾ (𝐴(,)𝐵)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · (1 / 𝑠))))
68	55	recnd 11248	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐹‘(𝑋 + 𝑠)) ∈ ℂ)
69	59	recnd 11248	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → if(0 < 𝑠, 𝑌, 𝑊) ∈ ℂ)
70	68, 69	negsubd 11586	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) + -if(0 < 𝑠, 𝑌, 𝑊)) = ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)))
71	70	eqcomd 2771	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) = ((𝐹‘(𝑋 + 𝑠)) + -if(0 < 𝑠, 𝑌, 𝑊)))
72	71	mpteq2dva 5206	. . . 4 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) + -if(0 < 𝑠, 𝑌, 𝑊))))
73	14, 52	readdcld 11249	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 + 𝑋) ∈ ℝ)
74	73	rexrd 11270	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 + 𝑋) ∈ ℝ^*)
75	74	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐴 + 𝑋) ∈ ℝ^*)
76	22, 52	readdcld 11249	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐵 + 𝑋) ∈ ℝ)
77	76	rexrd 11270	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 + 𝑋) ∈ ℝ^*)
78	77	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐵 + 𝑋) ∈ ℝ^*)
79	14	recnd 11248	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ ℂ)
80	52	recnd 11248	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ∈ ℂ)
81	79, 80	addcomd 11423	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 + 𝑋) = (𝑋 + 𝐴))
82	81	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐴 + 𝑋) = (𝑋 + 𝐴))
83	15, 9, 53, 27	ltadd2dd 11380	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐴) < (𝑋 + 𝑠))
84	82, 83	eqbrtrd 5135	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐴 + 𝑋) < (𝑋 + 𝑠))
85	9, 30, 53, 32	ltadd2dd 11380	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) < (𝑋 + 𝐵))
86	22	recnd 11248	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ ℂ)
87	80, 86	addcomd 11423	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑋 + 𝐵) = (𝐵 + 𝑋))
88	87	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐵) = (𝐵 + 𝑋))
89	85, 88	breqtrd 5139	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) < (𝐵 + 𝑋))
90	75, 78, 54, 84, 89	eliood 46247	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) ∈ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)))
91		fvres 6904	. . . . . . . . 9 ⊢ ((𝑋 + 𝑠) ∈ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)) → ((𝐹 ↾ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)))‘(𝑋 + 𝑠)) = (𝐹‘(𝑋 + 𝑠)))
92	90, 91	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹 ↾ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)))‘(𝑋 + 𝑠)) = (𝐹‘(𝑋 + 𝑠)))
93	92	eqcomd 2771	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐹‘(𝑋 + 𝑠)) = ((𝐹 ↾ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)))‘(𝑋 + 𝑠)))
94	93	mpteq2dva 5206	. . . . . 6 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹 ↾ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)))‘(𝑋 + 𝑠))))
95		ioosscn 13447	. . . . . . . 8 ⊢ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)) ⊆ ℂ
96	95	a1i 11	. . . . . . 7 ⊢ (𝜑 → ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)) ⊆ ℂ)
97		fourierdlem40.fcn	. . . . . . 7 ⊢ (𝜑 → (𝐹 ↾ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋))) ∈ (((𝐴 + 𝑋)(,)(𝐵 + 𝑋))–cn→ℂ))
98		ioosscn 13447	. . . . . . . 8 ⊢ (𝐴(,)𝐵) ⊆ ℂ
99	98	a1i 11	. . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
100	96, 97, 99, 80, 90	fourierdlem23 46877	. . . . . 6 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹 ↾ ((𝐴 + 𝑋)(,)(𝐵 + 𝑋)))‘(𝑋 + 𝑠))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
101	94, 100	eqeltrd 2865	. . . . 5 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
102		0red 11222	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 0 ∈ ℝ)
103	14	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ)
104	8	adantl 487	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℝ)
105		simplr 781	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 0 ≤ 𝐴)
106	27	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝑠)
107	102, 103, 104, 105, 106	lelttrd 11379	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 0 < 𝑠)
108	107	iftrued 4497	. . . . . . . . 9 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → if(0 < 𝑠, 𝑌, 𝑊) = 𝑌)
109	108	negeqd 11462	. . . . . . . 8 ⊢ (((𝜑 ∧ 0 ≤ 𝐴) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → -if(0 < 𝑠, 𝑌, 𝑊) = -𝑌)
110	109	mpteq2dva 5206	. . . . . . 7 ⊢ ((𝜑 ∧ 0 ≤ 𝐴) → (𝑠 ∈ (𝐴(,)𝐵) ↦ -if(0 < 𝑠, 𝑌, 𝑊)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ -𝑌))
111	56	renegcld 11652	. . . . . . . . . 10 ⊢ (𝜑 → -𝑌 ∈ ℝ)
112	111	recnd 11248	. . . . . . . . 9 ⊢ (𝜑 → -𝑌 ∈ ℂ)
113		ssid 3960	. . . . . . . . . 10 ⊢ ℂ ⊆ ℂ
114	113	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℂ ⊆ ℂ)
115	99, 112, 114	constcncfg 46619	. . . . . . . 8 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ -𝑌) ∈ ((𝐴(,)𝐵)–cn→ℂ))
116	115	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 0 ≤ 𝐴) → (𝑠 ∈ (𝐴(,)𝐵) ↦ -𝑌) ∈ ((𝐴(,)𝐵)–cn→ℂ))
117	110, 116	eqeltrd 2865	. . . . . 6 ⊢ ((𝜑 ∧ 0 ≤ 𝐴) → (𝑠 ∈ (𝐴(,)𝐵) ↦ -if(0 < 𝑠, 𝑌, 𝑊)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
118	14	rexrd 11270	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
119	118	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 0 ≤ 𝐴) ∧ ¬ 𝐵 ≤ 0) → 𝐴 ∈ ℝ^*)
120	23	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 0 ≤ 𝐴) ∧ ¬ 𝐵 ≤ 0) → 𝐵 ∈ ℝ^*)
121		0red 11222	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 0 ≤ 𝐴) ∧ ¬ 𝐵 ≤ 0) → 0 ∈ ℝ)
122		simpr 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 0 ≤ 𝐴) → ¬ 0 ≤ 𝐴)
123	14	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 0 ≤ 𝐴) → 𝐴 ∈ ℝ)
124		0red 11222	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 0 ≤ 𝐴) → 0 ∈ ℝ)
125	123, 124	ltnled 11368	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 0 ≤ 𝐴) → (𝐴 < 0 ↔ ¬ 0 ≤ 𝐴))
126	122, 125	mpbird 260	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 0 ≤ 𝐴) → 𝐴 < 0)
127	126	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 0 ≤ 𝐴) ∧ ¬ 𝐵 ≤ 0) → 𝐴 < 0)
128		simpr 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 0) → ¬ 𝐵 ≤ 0)
129		0red 11222	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 0) → 0 ∈ ℝ)
130	22	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 0) → 𝐵 ∈ ℝ)
131	129, 130	ltnled 11368	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 0) → (0 < 𝐵 ↔ ¬ 𝐵 ≤ 0))
132	128, 131	mpbird 260	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐵 ≤ 0) → 0 < 𝐵)
133	132	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 0 ≤ 𝐴) ∧ ¬ 𝐵 ≤ 0) → 0 < 𝐵)
134	119, 120, 121, 127, 133	eliood 46247	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 0 ≤ 𝐴) ∧ ¬ 𝐵 ≤ 0) → 0 ∈ (𝐴(,)𝐵))
135	46	ad2antrr 739	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 0 ≤ 𝐴) ∧ ¬ 𝐵 ≤ 0) → ¬ 0 ∈ (𝐴(,)𝐵))
136	134, 135	condan 830	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 0 ≤ 𝐴) → 𝐵 ≤ 0)
137	8	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℝ)
138		0red 11222	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 0 ∈ ℝ)
139	22	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ)
140	32	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 𝐵)
141		simplr 781	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ≤ 0)
142	137, 139, 138, 140, 141	ltletrd 11381	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 0)
143	137, 138, 142	ltnsymd 11370	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ¬ 0 < 𝑠)
144	143	iffalsed 4500	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → if(0 < 𝑠, 𝑌, 𝑊) = 𝑊)
145	144	negeqd 11462	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ≤ 0) ∧ 𝑠 ∈ (𝐴(,)𝐵)) → -if(0 < 𝑠, 𝑌, 𝑊) = -𝑊)
146	145	mpteq2dva 5206	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 0) → (𝑠 ∈ (𝐴(,)𝐵) ↦ -if(0 < 𝑠, 𝑌, 𝑊)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ -𝑊))
147	57	recnd 11248	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ ℂ)
148	147	negcld 11567	. . . . . . . . . 10 ⊢ (𝜑 → -𝑊 ∈ ℂ)
149	99, 148, 114	constcncfg 46619	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ -𝑊) ∈ ((𝐴(,)𝐵)–cn→ℂ))
150	149	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 0) → (𝑠 ∈ (𝐴(,)𝐵) ↦ -𝑊) ∈ ((𝐴(,)𝐵)–cn→ℂ))
151	146, 150	eqeltrd 2865	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 0) → (𝑠 ∈ (𝐴(,)𝐵) ↦ -if(0 < 𝑠, 𝑌, 𝑊)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
152	136, 151	syldan 603	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 0 ≤ 𝐴) → (𝑠 ∈ (𝐴(,)𝐵) ↦ -if(0 < 𝑠, 𝑌, 𝑊)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
153	117, 152	pm2.61dan 825	. . . . 5 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ -if(0 < 𝑠, 𝑌, 𝑊)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
154	101, 153	addcncf 25634	. . . 4 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) + -if(0 < 𝑠, 𝑌, 𝑊))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
155	72, 154	eqeltrd 2865	. . 3 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
156		eqid 2765	. . . 4 ⊢ (𝑠 ∈ (ℂ ∖ {0}) ↦ (1 / 𝑠)) = (𝑠 ∈ (ℂ ∖ {0}) ↦ (1 / 𝑠))
157		1cnd 11213	. . . . 5 ⊢ (𝜑 → 1 ∈ ℂ)
158	156	cdivcncf 25111	. . . . 5 ⊢ (1 ∈ ℂ → (𝑠 ∈ (ℂ ∖ {0}) ↦ (1 / 𝑠)) ∈ ((ℂ ∖ {0})–cn→ℂ))
159	157, 158	syl 18	. . . 4 ⊢ (𝜑 → (𝑠 ∈ (ℂ ∖ {0}) ↦ (1 / 𝑠)) ∈ ((ℂ ∖ {0})–cn→ℂ))
160		velsn 4607	. . . . . . . 8 ⊢ (𝑠 ∈ {0} ↔ 𝑠 = 0)
161	48, 160	sylnibr 332	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ¬ 𝑠 ∈ {0})
162	62, 161	eldifd 3917	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ (ℂ ∖ {0}))
163	162	ralrimiva 3159	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ (𝐴(,)𝐵)𝑠 ∈ (ℂ ∖ {0}))
164		dfss3 3927	. . . . 5 ⊢ ((𝐴(,)𝐵) ⊆ (ℂ ∖ {0}) ↔ ∀𝑠 ∈ (𝐴(,)𝐵)𝑠 ∈ (ℂ ∖ {0}))
165	163, 164	sylibr 237	. . . 4 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (ℂ ∖ {0}))
166	9, 63	rereccld 12053	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (1 / 𝑠) ∈ ℝ)
167	166	recnd 11248	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (1 / 𝑠) ∈ ℂ)
168	156, 159, 165, 114, 167	cncfmptssg 46618	. . 3 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (1 / 𝑠)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
169	155, 168	mulcncf 25636	. 2 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · (1 / 𝑠))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
170	67, 169	eqeltrd 2865	1 ⊢ (𝜑 → (𝐻 ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∖ cdif 3903 ⊆ wss 3906 ifcif 4489 {csn 4591 class class class wbr 5111 ↦ cmpt 5194 ↾ cres 5665 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 ℂcc 11109 ℝcr 11110 0cc0 11111 1c1 11112 + caddc 11114 · cmul 11116 ℝ^*cxr 11253 < clt 11254 ≤ cle 11255 − cmin 11452 -cneg 11453 / cdiv 11882 (,)cioo 13384 [,]cicc 13387 πcpi 16138 –cn→ccncf 25066

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-inf2 9613 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189 ax-addf 11190

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7680 df-om 7865 df-1st 7988 df-2nd 7989 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-map 8828 df-pm 8829 df-ixp 8898 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-fsupp 9325 df-fi 9374 df-sup 9405 df-inf 9406 df-oi 9475 df-card 9937 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-4 12316 df-5 12317 df-6 12318 df-7 12319 df-8 12320 df-9 12321 df-n0 12516 df-z 12603 df-dec 12724 df-uz 12875 df-q 12985 df-rp 13029 df-xneg 13149 df-xadd 13150 df-xmul 13151 df-ioo 13388 df-ioc 13389 df-ico 13390 df-icc 13391 df-fz 13548 df-fzo 13696 df-fl 13839 df-seq 14052 df-exp 14112 df-fac 14324 df-bc 14353 df-hash 14381 df-shft 15124 df-cj 15170 df-re 15171 df-im 15172 df-sqrt 15306 df-abs 15307 df-limsup 15542 df-clim 15559 df-rlim 15560 df-sum 15758 df-ef 16139 df-sin 16141 df-cos 16142 df-pi 16144 df-struct 17225 df-sets 17242 df-slot 17260 df-ndx 17272 df-base 17288 df-ress 17309 df-plusg 17341 df-mulr 17342 df-starv 17343 df-sca 17344 df-vsca 17345 df-ip 17346 df-tset 17347 df-ple 17348 df-ds 17350 df-unif 17351 df-hom 17352 df-cco 17353 df-rest 17493 df-topn 17494 df-0g 17512 df-gsum 17513 df-topgen 17514 df-pt 17515 df-prds 17518 df-xrs 17574 df-qtop 17579 df-imas 17580 df-xps 17582 df-mre 17656 df-mrc 17657 df-acs 17659 df-mgm 18716 df-sgrp 18799 df-mnd 18815 df-submnd 18866 df-mulg 19158 df-cntz 19411 df-cmn 19876 df-psmet 21544 df-xmet 21545 df-met 21546 df-bl 21547 df-mopn 21548 df-fbas 21549 df-fg 21550 df-cnfld 21553 df-top 23081 df-topon 23098 df-topsp 23120 df-bases 23133 df-cld 23206 df-ntr 23207 df-cls 23208 df-nei 23285 df-lp 23323 df-perf 23324 df-cn 23414 df-cnp 23415 df-haus 23502 df-tx 23750 df-hmeo 23943 df-fil 24034 df-fm 24126 df-flim 24127 df-flf 24128 df-xms 24508 df-ms 24509 df-tms 24510 df-cncf 25068 df-limc 26056 df-dv 26057

This theorem is used by: fourierdlem103 46956 fourierdlem104 46957

W3C validator