fourierdlem10 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem10 44833

Description: Condition on the bounds of a nonempty subinterval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem10.1	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem10.2	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem10.3	⊢ (𝜑 → 𝐶 ∈ ℝ)
fourierdlem10.4	⊢ (𝜑 → 𝐷 ∈ ℝ)
fourierdlem10.5	⊢ (𝜑 → 𝐶 < 𝐷)
fourierdlem10.6	⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))

**Assertion**
Ref	Expression
fourierdlem10	⊢ (𝜑 → (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵))

**Proof of Theorem fourierdlem10**
Step	Hyp	Ref	Expression
1		fourierdlem10.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ)
2		fourierdlem10.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ)
3		fourierdlem10.6	. . . . 5 ⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
4	3	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
5	2	rexrd 11264	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
6	5	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐶 ∈ ℝ^*)
7		fourierdlem10.4	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ ℝ)
8	7	rexrd 11264	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ ℝ^*)
9	8	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐷 ∈ ℝ^*)
10	2, 1	readdcld 11243	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 + 𝐴) ∈ ℝ)
11	10	rehalfcld 12459	. . . . . . . 8 ⊢ (𝜑 → ((𝐶 + 𝐴) / 2) ∈ ℝ)
12	2, 7	readdcld 11243	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 + 𝐷) ∈ ℝ)
13	12	rehalfcld 12459	. . . . . . . 8 ⊢ (𝜑 → ((𝐶 + 𝐷) / 2) ∈ ℝ)
14	11, 13	ifcld 4575	. . . . . . 7 ⊢ (𝜑 → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ)
15	14	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ)
16		simplr 768	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ 𝐴 ≤ 𝐷) → 𝐶 < 𝐴)
17	2	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ 𝐴 ≤ 𝐷) → 𝐶 ∈ ℝ)
18	1	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ 𝐴 ≤ 𝐷) → 𝐴 ∈ ℝ)
19		avglt1 12450	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 < 𝐴 ↔ 𝐶 < ((𝐶 + 𝐴) / 2)))
20	17, 18, 19	syl2anc 585	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ 𝐴 ≤ 𝐷) → (𝐶 < 𝐴 ↔ 𝐶 < ((𝐶 + 𝐴) / 2)))
21	16, 20	mpbid 231	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ 𝐴 ≤ 𝐷) → 𝐶 < ((𝐶 + 𝐴) / 2))
22		iftrue 4535	. . . . . . . . 9 ⊢ (𝐴 ≤ 𝐷 → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐶 + 𝐴) / 2))
23	22	adantl 483	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐶 + 𝐴) / 2))
24	21, 23	breqtrrd 5177	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ 𝐴 ≤ 𝐷) → 𝐶 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)))
25		fourierdlem10.5	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 < 𝐷)
26	25	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → 𝐶 < 𝐷)
27	2	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → 𝐶 ∈ ℝ)
28	7	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → 𝐷 ∈ ℝ)
29		avglt1 12450	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ) → (𝐶 < 𝐷 ↔ 𝐶 < ((𝐶 + 𝐷) / 2)))
30	27, 28, 29	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → (𝐶 < 𝐷 ↔ 𝐶 < ((𝐶 + 𝐷) / 2)))
31	26, 30	mpbid 231	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → 𝐶 < ((𝐶 + 𝐷) / 2))
32		iffalse 4538	. . . . . . . . . . 11 ⊢ (¬ 𝐴 ≤ 𝐷 → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐶 + 𝐷) / 2))
33	32	eqcomd 2739	. . . . . . . . . 10 ⊢ (¬ 𝐴 ≤ 𝐷 → ((𝐶 + 𝐷) / 2) = if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)))
34	33	adantl 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → ((𝐶 + 𝐷) / 2) = if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)))
35	31, 34	breqtrd 5175	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → 𝐶 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)))
36	35	adantlr 714	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐶 < 𝐴) ∧ ¬ 𝐴 ≤ 𝐷) → 𝐶 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)))
37	24, 36	pm2.61dan 812	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐶 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)))
38	22	adantl 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐶 + 𝐴) / 2))
39	10	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → (𝐶 + 𝐴) ∈ ℝ)
40	12	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → (𝐶 + 𝐷) ∈ ℝ)
41		2rp 12979	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ⁺
42	41	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → 2 ∈ ℝ⁺)
43	1	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → 𝐴 ∈ ℝ)
44	7	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → 𝐷 ∈ ℝ)
45	2	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → 𝐶 ∈ ℝ)
46		simpr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → 𝐴 ≤ 𝐷)
47	43, 44, 45, 46	leadd2dd 11829	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → (𝐶 + 𝐴) ≤ (𝐶 + 𝐷))
48	39, 40, 42, 47	lediv1dd 13074	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → ((𝐶 + 𝐴) / 2) ≤ ((𝐶 + 𝐷) / 2))
49	38, 48	eqbrtrd 5171	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ≤ ((𝐶 + 𝐷) / 2))
50	32	adantl 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐶 + 𝐷) / 2))
51	13	leidd 11780	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐶 + 𝐷) / 2) ≤ ((𝐶 + 𝐷) / 2))
52	51	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → ((𝐶 + 𝐷) / 2) ≤ ((𝐶 + 𝐷) / 2))
53	50, 52	eqbrtrd 5171	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ≤ ((𝐶 + 𝐷) / 2))
54	49, 53	pm2.61dan 812	. . . . . . . 8 ⊢ (𝜑 → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ≤ ((𝐶 + 𝐷) / 2))
55		avglt2 12451	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ) → (𝐶 < 𝐷 ↔ ((𝐶 + 𝐷) / 2) < 𝐷))
56	2, 7, 55	syl2anc 585	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 < 𝐷 ↔ ((𝐶 + 𝐷) / 2) < 𝐷))
57	25, 56	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → ((𝐶 + 𝐷) / 2) < 𝐷)
58	14, 13, 7, 54, 57	lelttrd 11372	. . . . . . 7 ⊢ (𝜑 → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) < 𝐷)
59	58	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) < 𝐷)
60	6, 9, 15, 37, 59	eliood 44211	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐶(,)𝐷))
61	1	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐴 ∈ ℝ)
62	11	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → ((𝐶 + 𝐴) / 2) ∈ ℝ)
63	14	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ)
64	63, 38	eqled 11317	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ≤ ((𝐶 + 𝐴) / 2))
65	14	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ)
66	11	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → ((𝐶 + 𝐴) / 2) ∈ ℝ)
67		simpr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → ¬ 𝐴 ≤ 𝐷)
68	1	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → 𝐴 ∈ ℝ)
69	28, 68	ltnled 11361	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → (𝐷 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐷))
70	67, 69	mpbird 257	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → 𝐷 < 𝐴)
71	12	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → (𝐶 + 𝐷) ∈ ℝ)
72	10	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → (𝐶 + 𝐴) ∈ ℝ)
73	41	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → 2 ∈ ℝ⁺)
74	7	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → 𝐷 ∈ ℝ)
75	1	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → 𝐴 ∈ ℝ)
76	2	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → 𝐶 ∈ ℝ)
77		simpr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → 𝐷 < 𝐴)
78	74, 75, 76, 77	ltadd2dd 11373	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → (𝐶 + 𝐷) < (𝐶 + 𝐴))
79	71, 72, 73, 78	ltdiv1dd 13073	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐷 < 𝐴) → ((𝐶 + 𝐷) / 2) < ((𝐶 + 𝐴) / 2))
80	70, 79	syldan 592	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → ((𝐶 + 𝐷) / 2) < ((𝐶 + 𝐴) / 2))
81	50, 80	eqbrtrd 5171	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) < ((𝐶 + 𝐴) / 2))
82	65, 66, 81	ltled 11362	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐴 ≤ 𝐷) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ≤ ((𝐶 + 𝐴) / 2))
83	64, 82	pm2.61dan 812	. . . . . . . . . 10 ⊢ (𝜑 → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ≤ ((𝐶 + 𝐴) / 2))
84	83	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ≤ ((𝐶 + 𝐴) / 2))
85		simpr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐶 < 𝐴)
86	2	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐶 ∈ ℝ)
87		avglt2 12451	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 < 𝐴 ↔ ((𝐶 + 𝐴) / 2) < 𝐴))
88	86, 61, 87	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → (𝐶 < 𝐴 ↔ ((𝐶 + 𝐴) / 2) < 𝐴))
89	85, 88	mpbid 231	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → ((𝐶 + 𝐴) / 2) < 𝐴)
90	15, 62, 61, 84, 89	lelttrd 11372	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) < 𝐴)
91	15, 61, 90	ltnsymd 11363	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → ¬ 𝐴 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)))
92	91	intn3an2d 1481	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → ¬ (if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ ∧ 𝐴 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∧ if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) < 𝐵))
93	1	rexrd 11264	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
94	93	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐴 ∈ ℝ^*)
95		fourierdlem10.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ)
96	95	rexrd 11264	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
97	96	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → 𝐵 ∈ ℝ^*)
98		elioo2 13365	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵) ↔ (if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ ∧ 𝐴 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∧ if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) < 𝐵)))
99	94, 97, 98	syl2anc 585	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → (if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵) ↔ (if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ ∧ 𝐴 < if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∧ if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) < 𝐵)))
100	92, 99	mtbird 325	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → ¬ if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵))
101		nelss 4048	. . . . 5 ⊢ ((if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐶(,)𝐷) ∧ ¬ if(𝐴 ≤ 𝐷, ((𝐶 + 𝐴) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵)) → ¬ (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
102	60, 100, 101	syl2anc 585	. . . 4 ⊢ ((𝜑 ∧ 𝐶 < 𝐴) → ¬ (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
103	4, 102	pm2.65da 816	. . 3 ⊢ (𝜑 → ¬ 𝐶 < 𝐴)
104	1, 2, 103	nltled 11364	. 2 ⊢ (𝜑 → 𝐴 ≤ 𝐶)
105	3	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
106	5	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐶 ∈ ℝ^*)
107	8	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐷 ∈ ℝ^*)
108	95, 7	readdcld 11243	. . . . . . . . 9 ⊢ (𝜑 → (𝐵 + 𝐷) ∈ ℝ)
109	108	rehalfcld 12459	. . . . . . . 8 ⊢ (𝜑 → ((𝐵 + 𝐷) / 2) ∈ ℝ)
110	109, 13	ifcld 4575	. . . . . . 7 ⊢ (𝜑 → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ)
111	110	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ)
112	2	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → 𝐶 ∈ ℝ)
113	13	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → ((𝐶 + 𝐷) / 2) ∈ ℝ)
114	110	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ)
115	2, 7, 29	syl2anc 585	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 < 𝐷 ↔ 𝐶 < ((𝐶 + 𝐷) / 2)))
116	25, 115	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 < ((𝐶 + 𝐷) / 2))
117	116	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → 𝐶 < ((𝐶 + 𝐷) / 2))
118	12	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → (𝐶 + 𝐷) ∈ ℝ)
119	108	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → (𝐵 + 𝐷) ∈ ℝ)
120	41	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → 2 ∈ ℝ⁺)
121	95	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → 𝐵 ∈ ℝ)
122	7	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → 𝐷 ∈ ℝ)
123		simpr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → 𝐶 ≤ 𝐵)
124	112, 121, 122, 123	leadd1dd 11828	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → (𝐶 + 𝐷) ≤ (𝐵 + 𝐷))
125	118, 119, 120, 124	lediv1dd 13074	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → ((𝐶 + 𝐷) / 2) ≤ ((𝐵 + 𝐷) / 2))
126		iftrue 4535	. . . . . . . . . . 11 ⊢ (𝐶 ≤ 𝐵 → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐵 + 𝐷) / 2))
127	126	adantl 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐵 + 𝐷) / 2))
128	125, 127	breqtrrd 5177	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → ((𝐶 + 𝐷) / 2) ≤ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
129	112, 113, 114, 117, 128	ltletrd 11374	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐵) → 𝐶 < if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
130	116	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐶 < ((𝐶 + 𝐷) / 2))
131		iffalse 4538	. . . . . . . . . . 11 ⊢ (¬ 𝐶 ≤ 𝐵 → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐶 + 𝐷) / 2))
132	131	eqcomd 2739	. . . . . . . . . 10 ⊢ (¬ 𝐶 ≤ 𝐵 → ((𝐶 + 𝐷) / 2) = if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
133	132	adantl 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → ((𝐶 + 𝐷) / 2) = if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
134	130, 133	breqtrd 5175	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐶 < if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
135	129, 134	pm2.61dan 812	. . . . . . 7 ⊢ (𝜑 → 𝐶 < if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
136	135	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐶 < if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
137	126	adantl 483	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 < 𝐷) ∧ 𝐶 ≤ 𝐵) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐵 + 𝐷) / 2))
138		simpr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐵 < 𝐷)
139	95	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐵 ∈ ℝ)
140	7	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐷 ∈ ℝ)
141		avglt2 12451	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ ∧ 𝐷 ∈ ℝ) → (𝐵 < 𝐷 ↔ ((𝐵 + 𝐷) / 2) < 𝐷))
142	139, 140, 141	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → (𝐵 < 𝐷 ↔ ((𝐵 + 𝐷) / 2) < 𝐷))
143	138, 142	mpbid 231	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → ((𝐵 + 𝐷) / 2) < 𝐷)
144	143	adantr 482	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 < 𝐷) ∧ 𝐶 ≤ 𝐵) → ((𝐵 + 𝐷) / 2) < 𝐷)
145	137, 144	eqbrtrd 5171	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐵 < 𝐷) ∧ 𝐶 ≤ 𝐵) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐷)
146	131	adantl 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) = ((𝐶 + 𝐷) / 2))
147	57	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → ((𝐶 + 𝐷) / 2) < 𝐷)
148	146, 147	eqbrtrd 5171	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐷)
149	148	adantlr 714	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐵 < 𝐷) ∧ ¬ 𝐶 ≤ 𝐵) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐷)
150	145, 149	pm2.61dan 812	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐷)
151	106, 107, 111, 136, 150	eliood 44211	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐶(,)𝐷))
152	109	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → ((𝐵 + 𝐷) / 2) ∈ ℝ)
153		avglt1 12450	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ ℝ ∧ 𝐷 ∈ ℝ) → (𝐵 < 𝐷 ↔ 𝐵 < ((𝐵 + 𝐷) / 2)))
154	139, 140, 153	syl2anc 585	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → (𝐵 < 𝐷 ↔ 𝐵 < ((𝐵 + 𝐷) / 2)))
155	138, 154	mpbid 231	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐵 < ((𝐵 + 𝐷) / 2))
156	139, 152, 155	ltled 11362	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐵 ≤ ((𝐵 + 𝐷) / 2))
157	156	adantr 482	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 < 𝐷) ∧ 𝐶 ≤ 𝐵) → 𝐵 ≤ ((𝐵 + 𝐷) / 2))
158	157, 137	breqtrrd 5177	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 < 𝐷) ∧ 𝐶 ≤ 𝐵) → 𝐵 ≤ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
159	95	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐵 ∈ ℝ)
160	13	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → ((𝐶 + 𝐷) / 2) ∈ ℝ)
161	2	adantr 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐶 ∈ ℝ)
162		simpr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → ¬ 𝐶 ≤ 𝐵)
163	159, 161	ltnled 11361	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → (𝐵 < 𝐶 ↔ ¬ 𝐶 ≤ 𝐵))
164	162, 163	mpbird 257	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐵 < 𝐶)
165	159, 161, 160, 164, 130	lttrd 11375	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐵 < ((𝐶 + 𝐷) / 2))
166	159, 160, 165	ltled 11362	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐵 ≤ ((𝐶 + 𝐷) / 2))
167	166, 133	breqtrd 5175	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐶 ≤ 𝐵) → 𝐵 ≤ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
168	167	adantlr 714	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 < 𝐷) ∧ ¬ 𝐶 ≤ 𝐵) → 𝐵 ≤ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
169	158, 168	pm2.61dan 812	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐵 ≤ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)))
170	139, 111, 169	lensymd 11365	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → ¬ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐵)
171	170	intn3an3d 1482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → ¬ (if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ ∧ 𝐴 < if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∧ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐵))
172	93	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐴 ∈ ℝ^*)
173	96	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → 𝐵 ∈ ℝ^*)
174		elioo2 13365	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵) ↔ (if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ ∧ 𝐴 < if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∧ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐵)))
175	172, 173, 174	syl2anc 585	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → (if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵) ↔ (if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ ℝ ∧ 𝐴 < if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∧ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) < 𝐵)))
176	171, 175	mtbird 325	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → ¬ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵))
177		nelss 4048	. . . . 5 ⊢ ((if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐶(,)𝐷) ∧ ¬ if(𝐶 ≤ 𝐵, ((𝐵 + 𝐷) / 2), ((𝐶 + 𝐷) / 2)) ∈ (𝐴(,)𝐵)) → ¬ (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
178	151, 176, 177	syl2anc 585	. . . 4 ⊢ ((𝜑 ∧ 𝐵 < 𝐷) → ¬ (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
179	105, 178	pm2.65da 816	. . 3 ⊢ (𝜑 → ¬ 𝐵 < 𝐷)
180	7, 95, 179	nltled 11364	. 2 ⊢ (𝜑 → 𝐷 ≤ 𝐵)
181	104, 180	jca 513	1 ⊢ (𝜑 → (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ⊆ wss 3949 ifcif 4529 class class class wbr 5149 (class class class)co 7409 ℝcr 11109 + caddc 11113 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 / cdiv 11871 2c2 12267 ℝ⁺crp 12974 (,)cioo 13324

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-po 5589 df-so 5590 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-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-2 12275 df-rp 12975 df-ioo 13328

This theorem is referenced by: fourierdlem32 44855 fourierdlem33 44856 fourierdlem46 44868 fourierdlem50 44872 fourierdlem72 44894 fourierdlem76 44898 fourierdlem89 44911 fourierdlem91 44913 fourierdlem103 44925 fourierdlem104 44926

W3C validator