itgle - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > itgle		Structured version Visualization version GIF version

Theorem itgle 26091

Description: Monotonicity of an integral. (Contributed by Mario Carneiro, 11-Aug-2014.)

**Hypotheses**
Ref	Expression
itgle.1	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
itgle.2	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
itgle.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
itgle.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ)
itgle.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝐶)

**Assertion**
Ref	Expression
itgle	⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ≤ ∫𝐴𝐶 d𝑥)

Distinct variable groups: 𝑥,𝐴 𝜑,𝑥 Allowed substitution hints: 𝐵(𝑥) 𝐶(𝑥)

**Proof of Theorem itgle**
Step	Hyp	Ref	Expression
1		itgle.1	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
2		itgle.3	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
3	2	iblrelem 26072	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ∈ ℝ ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) ∈ ℝ)))
4	1, 3	mpbid 235	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ∈ ℝ ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) ∈ ℝ))
5	4	simp2d 1161	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ∈ ℝ)
6		itgle.2	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
7		itgle.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ)
8	7	iblrelem 26072	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) ∈ ℝ ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ∈ ℝ)))
9	6, 8	mpbid 235	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) ∈ ℝ ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ∈ ℝ))
10	9	simp3d 1162	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ∈ ℝ)
11	9	simp2d 1161	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) ∈ ℝ)
12	4	simp3d 1162	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) ∈ ℝ)
13	2	ad2ant2r 760	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ∈ ℝ)
14	13	rexrd 11330	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ∈ ℝ^*)
15		simprr 785	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵)) → 0 ≤ 𝐵)
16		elxrge0 13557	. . . . . . 7 ⊢ (𝐵 ∈ (0[,]+∞) ↔ (𝐵 ∈ ℝ^* ∧ 0 ≤ 𝐵))
17	14, 15, 16	sylanbrc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ∈ (0[,]+∞))
18		0e0iccpnf 13559	. . . . . . 7 ⊢ 0 ∈ (0[,]+∞)
19	18	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ¬ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵)) → 0 ∈ (0[,]+∞))
20	17, 19	ifclda 4517	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ∈ (0[,]+∞))
21	20	fmpttd 7103	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)):ℝ⟶(0[,]+∞))
22	7	ad2ant2r 760	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶)) → 𝐶 ∈ ℝ)
23	22	rexrd 11330	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶)) → 𝐶 ∈ ℝ^*)
24		simprr 785	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶)) → 0 ≤ 𝐶)
25		elxrge0 13557	. . . . . . 7 ⊢ (𝐶 ∈ (0[,]+∞) ↔ (𝐶 ∈ ℝ^* ∧ 0 ≤ 𝐶))
26	23, 24, 25	sylanbrc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶)) → 𝐶 ∈ (0[,]+∞))
27	18	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ¬ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶)) → 0 ∈ (0[,]+∞))
28	26, 27	ifclda 4517	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0) ∈ (0[,]+∞))
29	28	fmpttd 7103	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)):ℝ⟶(0[,]+∞))
30		0re 11281	. . . . . . . . . . . 12 ⊢ 0 ∈ ℝ
31		max1 13284	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
32	30, 7, 31	sylancr 599	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
33		ifcl 4527	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
34	7, 30, 33	sylancl 598	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
35		itgle.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝐶)
36		max2 13286	. . . . . . . . . . . . 13 ⊢ ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ≤ if(0 ≤ 𝐶, 𝐶, 0))
37	30, 7, 36	sylancr 599	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ≤ if(0 ≤ 𝐶, 𝐶, 0))
38	2, 7, 34, 35, 37	letrd 11438	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ if(0 ≤ 𝐶, 𝐶, 0))
39		maxle 13290	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ) → (if(0 ≤ 𝐵, 𝐵, 0) ≤ if(0 ≤ 𝐶, 𝐶, 0) ↔ (0 ≤ if(0 ≤ 𝐶, 𝐶, 0) ∧ 𝐵 ≤ if(0 ≤ 𝐶, 𝐶, 0))))
40	30, 2, 34, 39	mp3an2i 1495	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ 𝐵, 𝐵, 0) ≤ if(0 ≤ 𝐶, 𝐶, 0) ↔ (0 ≤ if(0 ≤ 𝐶, 𝐶, 0) ∧ 𝐵 ≤ if(0 ≤ 𝐶, 𝐶, 0))))
41	32, 38, 40	mpbir2and 726	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ≤ if(0 ≤ 𝐶, 𝐶, 0))
42		iftrue 4487	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) = if(0 ≤ 𝐵, 𝐵, 0))
43	42	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) = if(0 ≤ 𝐵, 𝐵, 0))
44		iftrue 4487	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0) = if(0 ≤ 𝐶, 𝐶, 0))
45	44	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0) = if(0 ≤ 𝐶, 𝐶, 0))
46	41, 43, 45	3brtr4d 5136	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0))
47	46	ex 418	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0)))
48		0le0 12413	. . . . . . . . . 10 ⊢ 0 ≤ 0
49	48	a1i 11	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ 𝐴 → 0 ≤ 0)
50		iffalse 4490	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) = 0)
51		iffalse 4490	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0) = 0)
52	49, 50, 51	3brtr4d 5136	. . . . . . . 8 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0))
53	47, 52	pm2.61d1 182	. . . . . . 7 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0))
54		ifan 4535	. . . . . . 7 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if(𝑥 ∈ 𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0)
55		ifan 4535	. . . . . . 7 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0) = if(𝑥 ∈ 𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0)
56	53, 54, 55	3brtr4g 5138	. . . . . 6 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ≤ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))
57	56	ralrimivw 3158	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ≤ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))
58		reex 11262	. . . . . . 7 ⊢ ℝ ∈ V
59	58	a1i 11	. . . . . 6 ⊢ (𝜑 → ℝ ∈ V)
60		eqidd 2761	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)))
61		eqidd 2761	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)))
62	59, 20, 28, 60, 61	ofrfval2 7697	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) ↔ ∀𝑥 ∈ ℝ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ≤ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)))
63	57, 62	mpbird 260	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)))
64		itg2le 26021	. . . 4 ⊢ (((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))))
65	21, 29, 63, 64	syl3anc 1398	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))))
66	7	renegcld 11712	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐶 ∈ ℝ)
67	66	ad2ant2r 760	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶)) → -𝐶 ∈ ℝ)
68	67	rexrd 11330	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶)) → -𝐶 ∈ ℝ^*)
69		simprr 785	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶)) → 0 ≤ -𝐶)
70		elxrge0 13557	. . . . . . 7 ⊢ (-𝐶 ∈ (0[,]+∞) ↔ (-𝐶 ∈ ℝ^* ∧ 0 ≤ -𝐶))
71	68, 69, 70	sylanbrc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶)) → -𝐶 ∈ (0[,]+∞))
72	18	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ¬ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶)) → 0 ∈ (0[,]+∞))
73	71, 72	ifclda 4517	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ∈ (0[,]+∞))
74	73	fmpttd 7103	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)):ℝ⟶(0[,]+∞))
75	2	renegcld 11712	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℝ)
76	75	ad2ant2r 760	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵)) → -𝐵 ∈ ℝ)
77	76	rexrd 11330	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵)) → -𝐵 ∈ ℝ^*)
78		simprr 785	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵)) → 0 ≤ -𝐵)
79		elxrge0 13557	. . . . . . 7 ⊢ (-𝐵 ∈ (0[,]+∞) ↔ (-𝐵 ∈ ℝ^* ∧ 0 ≤ -𝐵))
80	77, 78, 79	sylanbrc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵)) → -𝐵 ∈ (0[,]+∞))
81	18	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ¬ (𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵)) → 0 ∈ (0[,]+∞))
82	80, 81	ifclda 4517	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0) ∈ (0[,]+∞))
83	82	fmpttd 7103	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)):ℝ⟶(0[,]+∞))
84		max1 13284	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ -𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
85	30, 75, 84	sylancr 599	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
86		ifcl 4527	. . . . . . . . . . . . 13 ⊢ ((-𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
87	75, 30, 86	sylancl 598	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
88	2, 7	lenegd 11864	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 𝐶 ↔ -𝐶 ≤ -𝐵))
89	35, 88	mpbid 235	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐶 ≤ -𝐵)
90		max2 13286	. . . . . . . . . . . . 13 ⊢ ((0 ∈ ℝ ∧ -𝐵 ∈ ℝ) → -𝐵 ≤ if(0 ≤ -𝐵, -𝐵, 0))
91	30, 75, 90	sylancr 599	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ≤ if(0 ≤ -𝐵, -𝐵, 0))
92	66, 75, 87, 89, 91	letrd 11438	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐶 ≤ if(0 ≤ -𝐵, -𝐵, 0))
93		maxle 13290	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ -𝐶 ∈ ℝ ∧ if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ) → (if(0 ≤ -𝐶, -𝐶, 0) ≤ if(0 ≤ -𝐵, -𝐵, 0) ↔ (0 ≤ if(0 ≤ -𝐵, -𝐵, 0) ∧ -𝐶 ≤ if(0 ≤ -𝐵, -𝐵, 0))))
94	30, 66, 87, 93	mp3an2i 1495	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) ≤ if(0 ≤ -𝐵, -𝐵, 0) ↔ (0 ≤ if(0 ≤ -𝐵, -𝐵, 0) ∧ -𝐶 ≤ if(0 ≤ -𝐵, -𝐵, 0))))
95	85, 92, 94	mpbir2and 726	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ≤ if(0 ≤ -𝐵, -𝐵, 0))
96		iftrue 4487	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) = if(0 ≤ -𝐶, -𝐶, 0))
97	96	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) = if(0 ≤ -𝐶, -𝐶, 0))
98		iftrue 4487	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0) = if(0 ≤ -𝐵, -𝐵, 0))
99	98	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0) = if(0 ≤ -𝐵, -𝐵, 0))
100	95, 97, 99	3brtr4d 5136	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0))
101	100	ex 418	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0)))
102		iffalse 4490	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) = 0)
103		iffalse 4490	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0) = 0)
104	49, 102, 103	3brtr4d 5136	. . . . . . . 8 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0))
105	101, 104	pm2.61d1 182	. . . . . . 7 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0))
106		ifan 4535	. . . . . . 7 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) = if(𝑥 ∈ 𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0)
107		ifan 4535	. . . . . . 7 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0) = if(𝑥 ∈ 𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0)
108	105, 106, 107	3brtr4g 5138	. . . . . 6 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ≤ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))
109	108	ralrimivw 3158	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ≤ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))
110		eqidd 2761	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)))
111		eqidd 2761	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))
112	59, 73, 82, 110, 111	ofrfval2 7697	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)) ↔ ∀𝑥 ∈ ℝ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ≤ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))
113	109, 112	mpbird 260	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))
114		itg2le 26021	. . . 4 ⊢ (((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) ∘_r ≤ (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))))
115	74, 83, 113, 114	syl3anc 1398	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ≤ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))))
116	5, 10, 11, 12, 65, 115	le2subd 11905	. 2 ⊢ (𝜑 → ((∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) − (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))) ≤ ((∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) − (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)))))
117	2, 1	itgrevallem1 26076	. 2 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = ((∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) − (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))))
118	7, 6	itgrevallem1 26076	. 2 ⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = ((∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) − (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)))))
119	116, 117, 118	3brtr4d 5136	1 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ≤ ∫𝐴𝐶 d𝑥)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3076 Vcvv 3450 ifcif 4481 class class class wbr 5102 ↦ cmpt 5185 ⟶wf 6523 ‘cfv 6527 (class class class)co 7408 ∘_r cofr 7675 ℝcr 11170 0cc0 11171 +∞cpnf 11311 ℝ^*cxr 11313 ≤ cle 11315 − cmin 11512 -cneg 11513 [,]cicc 13448 MblFncmbf 25896 ∫₂citg2 25898 𝐿¹cibl 25899 ∫citg 25900

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-inf2 9620 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 ax-pre-sup 11249 ax-addf 11250

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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-disj 5070 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-isom 6536 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-of 7676 df-ofr 7677 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8454 df-2o 8455 df-er 8695 df-map 8827 df-pm 8828 df-en 8952 df-dom 8953 df-sdom 8954 df-fin 8955 df-sup 9412 df-inf 9413 df-oi 9482 df-dju 9953 df-card 9991 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-div 11943 df-nn 12305 df-2 12374 df-3 12375 df-4 12376 df-n0 12576 df-z 12663 df-uz 12935 df-q 13045 df-rp 13090 df-xadd 13211 df-ioo 13449 df-ico 13451 df-icc 13452 df-fz 13609 df-fzo 13757 df-fl 13900 df-mod 13978 df-seq 14113 df-exp 14173 df-hash 14442 df-cj 15233 df-re 15234 df-im 15235 df-sqrt 15369 df-abs 15370 df-clim 15622 df-sum 15821 df-xmet 21632 df-met 21633 df-ovol 25746 df-vol 25747 df-mbf 25901 df-itg1 25902 df-itg2 25903 df-ibl 25904 df-itg 25905 df-0p 25952

This theorem is used by: itgge0 26092 itgless 26098 itgabs 26116 itgulm 26698 itgabsnc 38527 intlewftc 43031 wallispilem1 46997 fourierdlem47 47085 fourierdlem87 47125 etransclem23 47189

W3C validator