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

Theorem itgle 25080
Description: Monotonicity of an integral. (Contributed by Mario Carneiro, 11-Aug-2014.)
Hypotheses
Ref Expression
itgle.1 (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)
itgle.2 (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)
itgle.3 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)
itgle.4 ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ)
itgle.5 ((𝜑𝑥𝐴) → 𝐵𝐶)
Assertion
Ref Expression
itgle (𝜑 → ∫𝐴𝐵 d𝑥 ≤ ∫𝐴𝐶 d𝑥)
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem itgle
StepHypRef Expression
1 itgle.1 . . . . 5 (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)
2 itgle.3 . . . . . 6 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)
32iblrelem 25061 . . . . 5 (𝜑 → ((𝑥𝐴𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) ∈ ℝ)))
41, 3mpbid 231 . . . 4 (𝜑 → ((𝑥𝐴𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) ∈ ℝ))
54simp2d 1142 . . 3 (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ∈ ℝ)
6 itgle.2 . . . . 5 (𝜑 → (𝑥𝐴𝐶) ∈ 𝐿1)
7 itgle.4 . . . . . 6 ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ)
87iblrelem 25061 . . . . 5 (𝜑 → ((𝑥𝐴𝐶) ∈ 𝐿1 ↔ ((𝑥𝐴𝐶) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ∈ ℝ)))
96, 8mpbid 231 . . . 4 (𝜑 → ((𝑥𝐴𝐶) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ∈ ℝ))
109simp3d 1143 . . 3 (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ∈ ℝ)
119simp2d 1142 . . 3 (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) ∈ ℝ)
124simp3d 1143 . . 3 (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) ∈ ℝ)
132ad2ant2r 744 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ∈ ℝ)
1413rexrd 11126 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ∈ ℝ*)
15 simprr 770 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐵)) → 0 ≤ 𝐵)
16 elxrge0 13290 . . . . . . 7 (𝐵 ∈ (0[,]+∞) ↔ (𝐵 ∈ ℝ* ∧ 0 ≤ 𝐵))
1714, 15, 16sylanbrc 583 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ∈ (0[,]+∞))
18 0e0iccpnf 13292 . . . . . . 7 0 ∈ (0[,]+∞)
1918a1i 11 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ¬ (𝑥𝐴 ∧ 0 ≤ 𝐵)) → 0 ∈ (0[,]+∞))
2017, 19ifclda 4508 . . . . 5 ((𝜑𝑥 ∈ ℝ) → if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ∈ (0[,]+∞))
2120fmpttd 7045 . . . 4 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)):ℝ⟶(0[,]+∞))
227ad2ant2r 744 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐶)) → 𝐶 ∈ ℝ)
2322rexrd 11126 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐶)) → 𝐶 ∈ ℝ*)
24 simprr 770 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐶)) → 0 ≤ 𝐶)
25 elxrge0 13290 . . . . . . 7 (𝐶 ∈ (0[,]+∞) ↔ (𝐶 ∈ ℝ* ∧ 0 ≤ 𝐶))
2623, 24, 25sylanbrc 583 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ 𝐶)) → 𝐶 ∈ (0[,]+∞))
2718a1i 11 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ¬ (𝑥𝐴 ∧ 0 ≤ 𝐶)) → 0 ∈ (0[,]+∞))
2826, 27ifclda 4508 . . . . 5 ((𝜑𝑥 ∈ ℝ) → if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0) ∈ (0[,]+∞))
2928fmpttd 7045 . . . 4 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)):ℝ⟶(0[,]+∞))
30 0re 11078 . . . . . . . . . . . 12 0 ∈ ℝ
31 max1 13020 . . . . . . . . . . . 12 ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
3230, 7, 31sylancr 587 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → 0 ≤ if(0 ≤ 𝐶, 𝐶, 0))
33 ifcl 4518 . . . . . . . . . . . . 13 ((𝐶 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
347, 30, 33sylancl 586 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ)
35 itgle.5 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → 𝐵𝐶)
36 max2 13022 . . . . . . . . . . . . 13 ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ≤ if(0 ≤ 𝐶, 𝐶, 0))
3730, 7, 36sylancr 587 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → 𝐶 ≤ if(0 ≤ 𝐶, 𝐶, 0))
382, 7, 34, 35, 37letrd 11233 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → 𝐵 ≤ if(0 ≤ 𝐶, 𝐶, 0))
39 maxle 13026 . . . . . . . . . . . 12 ((0 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ if(0 ≤ 𝐶, 𝐶, 0) ∈ ℝ) → (if(0 ≤ 𝐵, 𝐵, 0) ≤ if(0 ≤ 𝐶, 𝐶, 0) ↔ (0 ≤ if(0 ≤ 𝐶, 𝐶, 0) ∧ 𝐵 ≤ if(0 ≤ 𝐶, 𝐶, 0))))
4030, 2, 34, 39mp3an2i 1465 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → (if(0 ≤ 𝐵, 𝐵, 0) ≤ if(0 ≤ 𝐶, 𝐶, 0) ↔ (0 ≤ if(0 ≤ 𝐶, 𝐶, 0) ∧ 𝐵 ≤ if(0 ≤ 𝐶, 𝐶, 0))))
4132, 38, 40mpbir2and 710 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ 𝐵, 𝐵, 0) ≤ if(0 ≤ 𝐶, 𝐶, 0))
42 iftrue 4479 . . . . . . . . . . 11 (𝑥𝐴 → if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) = if(0 ≤ 𝐵, 𝐵, 0))
4342adantl 482 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) = if(0 ≤ 𝐵, 𝐵, 0))
44 iftrue 4479 . . . . . . . . . . 11 (𝑥𝐴 → if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0) = if(0 ≤ 𝐶, 𝐶, 0))
4544adantl 482 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0) = if(0 ≤ 𝐶, 𝐶, 0))
4641, 43, 453brtr4d 5124 . . . . . . . . 9 ((𝜑𝑥𝐴) → if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0))
4746ex 413 . . . . . . . 8 (𝜑 → (𝑥𝐴 → if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0)))
48 0le0 12175 . . . . . . . . . 10 0 ≤ 0
4948a1i 11 . . . . . . . . 9 𝑥𝐴 → 0 ≤ 0)
50 iffalse 4482 . . . . . . . . 9 𝑥𝐴 → if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) = 0)
51 iffalse 4482 . . . . . . . . 9 𝑥𝐴 → if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0) = 0)
5249, 50, 513brtr4d 5124 . . . . . . . 8 𝑥𝐴 → if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0))
5347, 52pm2.61d1 180 . . . . . . 7 (𝜑 → if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0))
54 ifan 4526 . . . . . . 7 if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if(𝑥𝐴, if(0 ≤ 𝐵, 𝐵, 0), 0)
55 ifan 4526 . . . . . . 7 if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0) = if(𝑥𝐴, if(0 ≤ 𝐶, 𝐶, 0), 0)
5653, 54, 553brtr4g 5126 . . . . . 6 (𝜑 → if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ≤ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))
5756ralrimivw 3143 . . . . 5 (𝜑 → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ≤ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))
58 reex 11063 . . . . . . 7 ℝ ∈ V
5958a1i 11 . . . . . 6 (𝜑 → ℝ ∈ V)
60 eqidd 2737 . . . . . 6 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)))
61 eqidd 2737 . . . . . 6 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)))
6259, 20, 28, 60, 61ofrfval2 7616 . . . . 5 (𝜑 → ((𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) ∘r ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) ↔ ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) ≤ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)))
6357, 62mpbird 256 . . . 4 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) ∘r ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)))
64 itg2le 25010 . . . 4 (((𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0)) ∘r ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ≤ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))))
6521, 29, 63, 64syl3anc 1370 . . 3 (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) ≤ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))))
667renegcld 11503 . . . . . . . . 9 ((𝜑𝑥𝐴) → -𝐶 ∈ ℝ)
6766ad2ant2r 744 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐶)) → -𝐶 ∈ ℝ)
6867rexrd 11126 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐶)) → -𝐶 ∈ ℝ*)
69 simprr 770 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐶)) → 0 ≤ -𝐶)
70 elxrge0 13290 . . . . . . 7 (-𝐶 ∈ (0[,]+∞) ↔ (-𝐶 ∈ ℝ* ∧ 0 ≤ -𝐶))
7168, 69, 70sylanbrc 583 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐶)) → -𝐶 ∈ (0[,]+∞))
7218a1i 11 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ¬ (𝑥𝐴 ∧ 0 ≤ -𝐶)) → 0 ∈ (0[,]+∞))
7371, 72ifclda 4508 . . . . 5 ((𝜑𝑥 ∈ ℝ) → if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ∈ (0[,]+∞))
7473fmpttd 7045 . . . 4 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)):ℝ⟶(0[,]+∞))
752renegcld 11503 . . . . . . . . 9 ((𝜑𝑥𝐴) → -𝐵 ∈ ℝ)
7675ad2ant2r 744 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐵)) → -𝐵 ∈ ℝ)
7776rexrd 11126 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐵)) → -𝐵 ∈ ℝ*)
78 simprr 770 . . . . . . 7 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐵)) → 0 ≤ -𝐵)
79 elxrge0 13290 . . . . . . 7 (-𝐵 ∈ (0[,]+∞) ↔ (-𝐵 ∈ ℝ* ∧ 0 ≤ -𝐵))
8077, 78, 79sylanbrc 583 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ (𝑥𝐴 ∧ 0 ≤ -𝐵)) → -𝐵 ∈ (0[,]+∞))
8118a1i 11 . . . . . 6 (((𝜑𝑥 ∈ ℝ) ∧ ¬ (𝑥𝐴 ∧ 0 ≤ -𝐵)) → 0 ∈ (0[,]+∞))
8280, 81ifclda 4508 . . . . 5 ((𝜑𝑥 ∈ ℝ) → if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0) ∈ (0[,]+∞))
8382fmpttd 7045 . . . 4 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)):ℝ⟶(0[,]+∞))
84 max1 13020 . . . . . . . . . . . 12 ((0 ∈ ℝ ∧ -𝐵 ∈ ℝ) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
8530, 75, 84sylancr 587 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → 0 ≤ if(0 ≤ -𝐵, -𝐵, 0))
86 ifcl 4518 . . . . . . . . . . . . 13 ((-𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
8775, 30, 86sylancl 586 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ)
882, 7lenegd 11655 . . . . . . . . . . . . 13 ((𝜑𝑥𝐴) → (𝐵𝐶 ↔ -𝐶 ≤ -𝐵))
8935, 88mpbid 231 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → -𝐶 ≤ -𝐵)
90 max2 13022 . . . . . . . . . . . . 13 ((0 ∈ ℝ ∧ -𝐵 ∈ ℝ) → -𝐵 ≤ if(0 ≤ -𝐵, -𝐵, 0))
9130, 75, 90sylancr 587 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → -𝐵 ≤ if(0 ≤ -𝐵, -𝐵, 0))
9266, 75, 87, 89, 91letrd 11233 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → -𝐶 ≤ if(0 ≤ -𝐵, -𝐵, 0))
93 maxle 13026 . . . . . . . . . . . 12 ((0 ∈ ℝ ∧ -𝐶 ∈ ℝ ∧ if(0 ≤ -𝐵, -𝐵, 0) ∈ ℝ) → (if(0 ≤ -𝐶, -𝐶, 0) ≤ if(0 ≤ -𝐵, -𝐵, 0) ↔ (0 ≤ if(0 ≤ -𝐵, -𝐵, 0) ∧ -𝐶 ≤ if(0 ≤ -𝐵, -𝐵, 0))))
9430, 66, 87, 93mp3an2i 1465 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → (if(0 ≤ -𝐶, -𝐶, 0) ≤ if(0 ≤ -𝐵, -𝐵, 0) ↔ (0 ≤ if(0 ≤ -𝐵, -𝐵, 0) ∧ -𝐶 ≤ if(0 ≤ -𝐵, -𝐵, 0))))
9585, 92, 94mpbir2and 710 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ -𝐶, -𝐶, 0) ≤ if(0 ≤ -𝐵, -𝐵, 0))
96 iftrue 4479 . . . . . . . . . . 11 (𝑥𝐴 → if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) = if(0 ≤ -𝐶, -𝐶, 0))
9796adantl 482 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) = if(0 ≤ -𝐶, -𝐶, 0))
98 iftrue 4479 . . . . . . . . . . 11 (𝑥𝐴 → if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0) = if(0 ≤ -𝐵, -𝐵, 0))
9998adantl 482 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0) = if(0 ≤ -𝐵, -𝐵, 0))
10095, 97, 993brtr4d 5124 . . . . . . . . 9 ((𝜑𝑥𝐴) → if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0))
101100ex 413 . . . . . . . 8 (𝜑 → (𝑥𝐴 → if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0)))
102 iffalse 4482 . . . . . . . . 9 𝑥𝐴 → if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) = 0)
103 iffalse 4482 . . . . . . . . 9 𝑥𝐴 → if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0) = 0)
10449, 102, 1033brtr4d 5124 . . . . . . . 8 𝑥𝐴 → if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0))
105101, 104pm2.61d1 180 . . . . . . 7 (𝜑 → if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0) ≤ if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0))
106 ifan 4526 . . . . . . 7 if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) = if(𝑥𝐴, if(0 ≤ -𝐶, -𝐶, 0), 0)
107 ifan 4526 . . . . . . 7 if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0) = if(𝑥𝐴, if(0 ≤ -𝐵, -𝐵, 0), 0)
108105, 106, 1073brtr4g 5126 . . . . . 6 (𝜑 → if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ≤ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))
109108ralrimivw 3143 . . . . 5 (𝜑 → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ≤ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))
110 eqidd 2737 . . . . . 6 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)))
111 eqidd 2737 . . . . . 6 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))
11259, 73, 82, 110, 111ofrfval2 7616 . . . . 5 (𝜑 → ((𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) ∘r ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)) ↔ ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0) ≤ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))
113109, 112mpbird 256 . . . 4 (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) ∘r ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))
114 itg2le 25010 . . . 4 (((𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)):ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)) ∘r ≤ (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ≤ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))))
11574, 83, 113, 114syl3anc 1370 . . 3 (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0))) ≤ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0))))
1165, 10, 11, 12, 65, 115le2subd 11696 . 2 (𝜑 → ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) − (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))) ≤ ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) − (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)))))
1172, 1itgrevallem1 25065 . 2 (𝜑 → ∫𝐴𝐵 d𝑥 = ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0))) − (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐵), -𝐵, 0)))))
1187, 6itgrevallem1 25065 . 2 (𝜑 → ∫𝐴𝐶 d𝑥 = ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0))) − (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -𝐶), -𝐶, 0)))))
119116, 117, 1183brtr4d 5124 1 (𝜑 → ∫𝐴𝐵 d𝑥 ≤ ∫𝐴𝐶 d𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  w3a 1086   = wceq 1540  wcel 2105  wral 3061  Vcvv 3441  ifcif 4473   class class class wbr 5092  cmpt 5175  wf 6475  cfv 6479  (class class class)co 7337  r cofr 7594  cr 10971  0cc0 10972  +∞cpnf 11107  *cxr 11109  cle 11111  cmin 11306  -cneg 11307  [,]cicc 13183  MblFncmbf 24884  2citg2 24886  𝐿1cibl 24887  citg 24888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-rep 5229  ax-sep 5243  ax-nul 5250  ax-pow 5308  ax-pr 5372  ax-un 7650  ax-inf2 9498  ax-cnex 11028  ax-resscn 11029  ax-1cn 11030  ax-icn 11031  ax-addcl 11032  ax-addrcl 11033  ax-mulcl 11034  ax-mulrcl 11035  ax-mulcom 11036  ax-addass 11037  ax-mulass 11038  ax-distr 11039  ax-i2m1 11040  ax-1ne0 11041  ax-1rid 11042  ax-rnegex 11043  ax-rrecex 11044  ax-cnre 11045  ax-pre-lttri 11046  ax-pre-lttrn 11047  ax-pre-ltadd 11048  ax-pre-mulgt0 11049  ax-pre-sup 11050  ax-addf 11051
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3349  df-reu 3350  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3917  df-nul 4270  df-if 4474  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-int 4895  df-iun 4943  df-disj 5058  df-br 5093  df-opab 5155  df-mpt 5176  df-tr 5210  df-id 5518  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5575  df-se 5576  df-we 5577  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6238  df-ord 6305  df-on 6306  df-lim 6307  df-suc 6308  df-iota 6431  df-fun 6481  df-fn 6482  df-f 6483  df-f1 6484  df-fo 6485  df-f1o 6486  df-fv 6487  df-isom 6488  df-riota 7293  df-ov 7340  df-oprab 7341  df-mpo 7342  df-of 7595  df-ofr 7596  df-om 7781  df-1st 7899  df-2nd 7900  df-frecs 8167  df-wrecs 8198  df-recs 8272  df-rdg 8311  df-1o 8367  df-2o 8368  df-er 8569  df-map 8688  df-pm 8689  df-en 8805  df-dom 8806  df-sdom 8807  df-fin 8808  df-sup 9299  df-inf 9300  df-oi 9367  df-dju 9758  df-card 9796  df-pnf 11112  df-mnf 11113  df-xr 11114  df-ltxr 11115  df-le 11116  df-sub 11308  df-neg 11309  df-div 11734  df-nn 12075  df-2 12137  df-3 12138  df-4 12139  df-n0 12335  df-z 12421  df-uz 12684  df-q 12790  df-rp 12832  df-xadd 12950  df-ioo 13184  df-ico 13186  df-icc 13187  df-fz 13341  df-fzo 13484  df-fl 13613  df-mod 13691  df-seq 13823  df-exp 13884  df-hash 14146  df-cj 14909  df-re 14910  df-im 14911  df-sqrt 15045  df-abs 15046  df-clim 15296  df-sum 15497  df-xmet 20696  df-met 20697  df-ovol 24734  df-vol 24735  df-mbf 24889  df-itg1 24890  df-itg2 24891  df-ibl 24892  df-itg 24893  df-0p 24940
This theorem is referenced by:  itgge0  25081  itgless  25087  itgabs  25105  itgulm  25673  itgabsnc  35959  intlewftc  40331  wallispilem1  43950  fourierdlem47  44038  fourierdlem87  44078  etransclem23  44142
  Copyright terms: Public domain W3C validator